java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec3_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:10:33,021 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:10:33,023 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:10:33,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:10:33,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:10:33,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:10:33,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:10:33,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:10:33,049 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:10:33,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:10:33,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:10:33,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:10:33,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:10:33,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:10:33,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:10:33,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:10:33,061 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:10:33,062 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:10:33,067 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:10:33,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:10:33,073 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:10:33,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:10:33,078 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:10:33,079 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:10:33,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:10:33,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:10:33,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:10:33,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:10:33,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:10:33,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:10:33,085 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:10:33,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:10:33,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:10:33,087 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:10:33,088 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:10:33,088 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:10:33,089 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:10:33,089 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:10:33,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:10:33,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:10:33,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:10:33,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:10:33,116 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:10:33,116 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:10:33,118 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:10:33,119 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:10:33,119 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:10:33,119 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:10:33,119 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:10:33,120 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:10:33,120 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:10:33,120 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:10:33,120 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:10:33,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:10:33,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:10:33,121 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:10:33,121 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:10:33,121 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:10:33,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:10:33,122 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:10:33,122 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:10:33,122 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:10:33,122 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:10:33,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:33,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:10:33,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:10:33,123 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:10:33,124 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:10:33,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:10:33,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:10:33,124 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:10:33,407 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:10:33,421 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:10:33,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:10:33,426 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:10:33,426 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:10:33,427 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec3_product09.cil.c [2019-10-15 01:10:33,507 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7021f2e0/38d514893e374f64849e7070af79855b/FLAG10cdb2bc1 [2019-10-15 01:10:34,167 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:10:34,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec3_product09.cil.c [2019-10-15 01:10:34,186 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7021f2e0/38d514893e374f64849e7070af79855b/FLAG10cdb2bc1 [2019-10-15 01:10:34,357 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7021f2e0/38d514893e374f64849e7070af79855b [2019-10-15 01:10:34,372 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:10:34,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:10:34,374 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:34,374 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:10:34,378 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:10:34,379 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:34" (1/1) ... [2019-10-15 01:10:34,382 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35aafeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:34, skipping insertion in model container [2019-10-15 01:10:34,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:10:34" (1/1) ... [2019-10-15 01:10:34,392 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:10:34,483 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:10:35,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:35,350 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:10:35,494 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:10:35,574 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:10:35,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35 WrapperNode [2019-10-15 01:10:35,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:10:35,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:10:35,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:10:35,577 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:10:35,596 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (1/1) ... [2019-10-15 01:10:35,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (1/1) ... [2019-10-15 01:10:35,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (1/1) ... [2019-10-15 01:10:35,629 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (1/1) ... [2019-10-15 01:10:35,714 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (1/1) ... [2019-10-15 01:10:35,748 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (1/1) ... [2019-10-15 01:10:35,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (1/1) ... [2019-10-15 01:10:35,788 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:10:35,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:10:35,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:10:35,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:10:35,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:10:35,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:10:35,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:10:35,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:35,871 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:10:35,871 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:10:35,872 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:10:35,872 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:10:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:10:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:10:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:10:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:10:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:10:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:10:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:10:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:10:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:10:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:10:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:10:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:10:35,878 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:10:35,879 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:10:35,879 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:10:35,879 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:10:35,879 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:10:35,879 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:10:35,880 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:10:35,880 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:10:35,880 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:10:35,880 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:10:35,881 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:10:35,881 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:10:35,881 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:10:35,881 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:10:35,881 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:10:35,881 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:10:35,882 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:10:35,882 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:35,882 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:10:35,882 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:10:35,882 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:10:35,883 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:10:35,883 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:10:35,883 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:10:35,883 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:10:35,883 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:10:35,883 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:10:35,884 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:10:35,884 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:10:35,884 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:10:35,884 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:10:35,884 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:10:35,884 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:10:35,885 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:10:35,885 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:10:35,885 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:10:35,885 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:10:35,885 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:10:35,885 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:10:35,886 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:10:35,886 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:10:35,886 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:10:35,887 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:10:35,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:10:35,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:35,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:35,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:35,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:35,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:35,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:10:35,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:10:35,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:10:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:10:35,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:10:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:10:35,890 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:10:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:10:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:10:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:10:35,891 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:10:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:10:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:10:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:10:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:10:35,892 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:10:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:10:35,893 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:10:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:10:35,894 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:10:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:10:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:10:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:10:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:10:35,895 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:10:35,896 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:10:35,896 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:10:35,896 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:10:35,896 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:10:35,896 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:10:35,896 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:10:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:10:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:10:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:10:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:10:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:10:35,897 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:10:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:10:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:10:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:10:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:10:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:10:35,898 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:10:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:10:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:10:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:10:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:10:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__1 [2019-10-15 01:10:35,899 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification3_spec__2 [2019-10-15 01:10:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:10:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:10:35,900 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:10:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:10:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:10:35,901 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:10:35,902 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:10:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:10:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:10:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:10:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:10:35,903 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:10:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:10:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:10:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:10:35,904 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:10:35,905 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:10:35,905 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:10:35,905 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:10:35,906 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:10:35,909 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:10:35,909 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:10:35,912 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:10:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:10:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:10:35,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:10:35,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:10:35,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:10:35,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:10:35,920 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:10:35,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:10:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:10:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:10:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:10:35,921 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:10:35,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:10:35,922 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:10:35,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:10:35,922 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:10:35,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:10:38,329 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:10:38,329 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:10:38,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:38 BoogieIcfgContainer [2019-10-15 01:10:38,332 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:10:38,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:10:38,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:10:38,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:10:38,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:10:34" (1/3) ... [2019-10-15 01:10:38,338 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa0a89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:38, skipping insertion in model container [2019-10-15 01:10:38,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:10:35" (2/3) ... [2019-10-15 01:10:38,339 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5aa0a89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:10:38, skipping insertion in model container [2019-10-15 01:10:38,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:10:38" (3/3) ... [2019-10-15 01:10:38,341 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec3_product09.cil.c [2019-10-15 01:10:38,352 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:10:38,362 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:10:38,374 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:10:38,413 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:10:38,413 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:10:38,413 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:10:38,413 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:10:38,413 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:10:38,413 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:10:38,414 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:10:38,414 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:10:38,454 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states. [2019-10-15 01:10:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:10:38,483 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:38,485 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:38,489 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:38,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:38,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1161933342, now seen corresponding path program 1 times [2019-10-15 01:10:38,506 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:38,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932074224] [2019-10-15 01:10:38,506 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:38,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:38,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:39,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932074224] [2019-10-15 01:10:39,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:39,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:39,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285456728] [2019-10-15 01:10:39,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:39,352 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:39,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:39,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:39,370 INFO L87 Difference]: Start difference. First operand 757 states. Second operand 7 states. [2019-10-15 01:10:39,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:39,691 INFO L93 Difference]: Finished difference Result 1193 states and 1952 transitions. [2019-10-15 01:10:39,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:39,693 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2019-10-15 01:10:39,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:39,729 INFO L225 Difference]: With dead ends: 1193 [2019-10-15 01:10:39,729 INFO L226 Difference]: Without dead ends: 605 [2019-10-15 01:10:39,743 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:39,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-15 01:10:39,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-10-15 01:10:39,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-15 01:10:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 971 transitions. [2019-10-15 01:10:39,904 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 971 transitions. Word has length 115 [2019-10-15 01:10:39,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:39,905 INFO L462 AbstractCegarLoop]: Abstraction has 603 states and 971 transitions. [2019-10-15 01:10:39,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:39,906 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 971 transitions. [2019-10-15 01:10:39,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:10:39,933 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:39,933 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:39,934 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:39,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:39,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1514671527, now seen corresponding path program 1 times [2019-10-15 01:10:39,935 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:39,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9184016] [2019-10-15 01:10:39,940 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:39,941 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:39,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:40,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:40,171 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9184016] [2019-10-15 01:10:40,171 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:40,171 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:10:40,171 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65615984] [2019-10-15 01:10:40,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:10:40,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:40,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:10:40,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:10:40,174 INFO L87 Difference]: Start difference. First operand 603 states and 971 transitions. Second operand 4 states. [2019-10-15 01:10:40,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:40,240 INFO L93 Difference]: Finished difference Result 1172 states and 1907 transitions. [2019-10-15 01:10:40,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:10:40,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-15 01:10:40,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:40,245 INFO L225 Difference]: With dead ends: 1172 [2019-10-15 01:10:40,245 INFO L226 Difference]: Without dead ends: 585 [2019-10-15 01:10:40,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:40,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-15 01:10:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-15 01:10:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-15 01:10:40,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 938 transitions. [2019-10-15 01:10:40,327 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 938 transitions. Word has length 116 [2019-10-15 01:10:40,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:40,329 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 938 transitions. [2019-10-15 01:10:40,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:10:40,329 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 938 transitions. [2019-10-15 01:10:40,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:10:40,340 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:40,340 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:40,342 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:40,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:40,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1422688811, now seen corresponding path program 1 times [2019-10-15 01:10:40,347 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:40,347 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932714650] [2019-10-15 01:10:40,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:40,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:40,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:40,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:40,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932714650] [2019-10-15 01:10:40,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:40,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:40,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041699913] [2019-10-15 01:10:40,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:40,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:40,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:40,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:40,578 INFO L87 Difference]: Start difference. First operand 585 states and 938 transitions. Second operand 7 states. [2019-10-15 01:10:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:40,687 INFO L93 Difference]: Finished difference Result 1141 states and 1849 transitions. [2019-10-15 01:10:40,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:40,688 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 116 [2019-10-15 01:10:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:40,695 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:10:40,695 INFO L226 Difference]: Without dead ends: 579 [2019-10-15 01:10:40,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-10-15 01:10:40,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 579. [2019-10-15 01:10:40,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-15 01:10:40,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 925 transitions. [2019-10-15 01:10:40,735 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 925 transitions. Word has length 116 [2019-10-15 01:10:40,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:40,736 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 925 transitions. [2019-10-15 01:10:40,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 925 transitions. [2019-10-15 01:10:40,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:10:40,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:40,740 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:40,740 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:40,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:40,741 INFO L82 PathProgramCache]: Analyzing trace with hash 877146082, now seen corresponding path program 1 times [2019-10-15 01:10:40,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:40,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039098443] [2019-10-15 01:10:40,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:40,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:40,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:40,937 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039098443] [2019-10-15 01:10:40,937 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:40,937 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:40,937 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756344684] [2019-10-15 01:10:40,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:40,939 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:40,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:40,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:40,940 INFO L87 Difference]: Start difference. First operand 579 states and 925 transitions. Second operand 7 states. [2019-10-15 01:10:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:41,066 INFO L93 Difference]: Finished difference Result 1129 states and 1823 transitions. [2019-10-15 01:10:41,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:41,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-15 01:10:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:41,080 INFO L225 Difference]: With dead ends: 1129 [2019-10-15 01:10:41,080 INFO L226 Difference]: Without dead ends: 573 [2019-10-15 01:10:41,088 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:41,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2019-10-15 01:10:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 573. [2019-10-15 01:10:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-10-15 01:10:41,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 912 transitions. [2019-10-15 01:10:41,129 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 912 transitions. Word has length 117 [2019-10-15 01:10:41,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:41,130 INFO L462 AbstractCegarLoop]: Abstraction has 573 states and 912 transitions. [2019-10-15 01:10:41,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:41,130 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 912 transitions. [2019-10-15 01:10:41,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:10:41,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:41,136 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:41,137 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:41,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:41,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1106162991, now seen corresponding path program 1 times [2019-10-15 01:10:41,137 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:41,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399780424] [2019-10-15 01:10:41,138 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:41,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:41,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:41,369 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399780424] [2019-10-15 01:10:41,369 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:41,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:41,369 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780763260] [2019-10-15 01:10:41,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:41,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:41,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:41,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:41,371 INFO L87 Difference]: Start difference. First operand 573 states and 912 transitions. Second operand 7 states. [2019-10-15 01:10:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:41,465 INFO L93 Difference]: Finished difference Result 1117 states and 1797 transitions. [2019-10-15 01:10:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:41,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-15 01:10:41,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:41,474 INFO L225 Difference]: With dead ends: 1117 [2019-10-15 01:10:41,474 INFO L226 Difference]: Without dead ends: 567 [2019-10-15 01:10:41,479 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:41,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-15 01:10:41,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-10-15 01:10:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-15 01:10:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 899 transitions. [2019-10-15 01:10:41,502 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 899 transitions. Word has length 118 [2019-10-15 01:10:41,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:41,502 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 899 transitions. [2019-10-15 01:10:41,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:41,503 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 899 transitions. [2019-10-15 01:10:41,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:10:41,507 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:41,507 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:41,507 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:41,509 INFO L82 PathProgramCache]: Analyzing trace with hash -74424208, now seen corresponding path program 1 times [2019-10-15 01:10:41,510 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:41,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398034677] [2019-10-15 01:10:41,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,510 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:41,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:41,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398034677] [2019-10-15 01:10:41,680 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:41,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:41,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308692904] [2019-10-15 01:10:41,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:41,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:41,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:41,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:41,683 INFO L87 Difference]: Start difference. First operand 567 states and 899 transitions. Second operand 7 states. [2019-10-15 01:10:41,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:41,788 INFO L93 Difference]: Finished difference Result 1105 states and 1771 transitions. [2019-10-15 01:10:41,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:10:41,789 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-15 01:10:41,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:41,801 INFO L225 Difference]: With dead ends: 1105 [2019-10-15 01:10:41,801 INFO L226 Difference]: Without dead ends: 567 [2019-10-15 01:10:41,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:10:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-15 01:10:41,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-10-15 01:10:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-15 01:10:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 898 transitions. [2019-10-15 01:10:41,834 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 898 transitions. Word has length 118 [2019-10-15 01:10:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:41,835 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 898 transitions. [2019-10-15 01:10:41,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 898 transitions. [2019-10-15 01:10:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:10:41,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:41,839 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:41,840 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash -423275098, now seen corresponding path program 1 times [2019-10-15 01:10:41,841 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:41,841 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516945925] [2019-10-15 01:10:41,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:41,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:42,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:42,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516945925] [2019-10-15 01:10:42,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:42,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:42,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669125667] [2019-10-15 01:10:42,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:42,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:42,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:42,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:42,064 INFO L87 Difference]: Start difference. First operand 567 states and 898 transitions. Second operand 5 states. [2019-10-15 01:10:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:42,145 INFO L93 Difference]: Finished difference Result 1104 states and 1768 transitions. [2019-10-15 01:10:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:42,145 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-10-15 01:10:42,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:42,149 INFO L225 Difference]: With dead ends: 1104 [2019-10-15 01:10:42,150 INFO L226 Difference]: Without dead ends: 567 [2019-10-15 01:10:42,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-15 01:10:42,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-10-15 01:10:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-15 01:10:42,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 897 transitions. [2019-10-15 01:10:42,175 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 897 transitions. Word has length 119 [2019-10-15 01:10:42,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:42,176 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 897 transitions. [2019-10-15 01:10:42,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:42,176 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 897 transitions. [2019-10-15 01:10:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:10:42,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:42,180 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:42,181 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:42,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:42,181 INFO L82 PathProgramCache]: Analyzing trace with hash -161455577, now seen corresponding path program 1 times [2019-10-15 01:10:42,181 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:42,182 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686644392] [2019-10-15 01:10:42,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,182 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:42,319 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:42,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686644392] [2019-10-15 01:10:42,320 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:42,320 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:42,320 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965992708] [2019-10-15 01:10:42,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:42,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:42,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:42,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:42,322 INFO L87 Difference]: Start difference. First operand 567 states and 897 transitions. Second operand 5 states. [2019-10-15 01:10:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:42,396 INFO L93 Difference]: Finished difference Result 1104 states and 1766 transitions. [2019-10-15 01:10:42,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:42,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-10-15 01:10:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:42,402 INFO L225 Difference]: With dead ends: 1104 [2019-10-15 01:10:42,403 INFO L226 Difference]: Without dead ends: 567 [2019-10-15 01:10:42,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:42,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-15 01:10:42,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-10-15 01:10:42,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-15 01:10:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 896 transitions. [2019-10-15 01:10:42,428 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 896 transitions. Word has length 120 [2019-10-15 01:10:42,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:42,429 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 896 transitions. [2019-10-15 01:10:42,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 896 transitions. [2019-10-15 01:10:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:10:42,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:42,433 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:42,433 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:42,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash -158807839, now seen corresponding path program 1 times [2019-10-15 01:10:42,434 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:42,434 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355469145] [2019-10-15 01:10:42,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,434 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:42,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:42,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355469145] [2019-10-15 01:10:42,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:42,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:42,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125908642] [2019-10-15 01:10:42,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:42,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:42,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:42,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:42,576 INFO L87 Difference]: Start difference. First operand 567 states and 896 transitions. Second operand 5 states. [2019-10-15 01:10:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:42,650 INFO L93 Difference]: Finished difference Result 1104 states and 1764 transitions. [2019-10-15 01:10:42,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:42,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-10-15 01:10:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:42,656 INFO L225 Difference]: With dead ends: 1104 [2019-10-15 01:10:42,657 INFO L226 Difference]: Without dead ends: 567 [2019-10-15 01:10:42,660 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:42,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-15 01:10:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-10-15 01:10:42,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-15 01:10:42,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 895 transitions. [2019-10-15 01:10:42,683 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 895 transitions. Word has length 121 [2019-10-15 01:10:42,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:42,683 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 895 transitions. [2019-10-15 01:10:42,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:42,683 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 895 transitions. [2019-10-15 01:10:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:10:42,687 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:42,687 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:42,687 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:42,688 INFO L82 PathProgramCache]: Analyzing trace with hash 399449218, now seen corresponding path program 1 times [2019-10-15 01:10:42,688 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:42,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113110470] [2019-10-15 01:10:42,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:42,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:42,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113110470] [2019-10-15 01:10:42,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:42,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:10:42,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356120983] [2019-10-15 01:10:42,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:42,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:42,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:42,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:10:42,883 INFO L87 Difference]: Start difference. First operand 567 states and 895 transitions. Second operand 5 states. [2019-10-15 01:10:42,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:42,951 INFO L93 Difference]: Finished difference Result 1104 states and 1762 transitions. [2019-10-15 01:10:42,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:42,952 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-10-15 01:10:42,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:42,956 INFO L225 Difference]: With dead ends: 1104 [2019-10-15 01:10:42,957 INFO L226 Difference]: Without dead ends: 567 [2019-10-15 01:10:42,960 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:10:42,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-15 01:10:42,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2019-10-15 01:10:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2019-10-15 01:10:42,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 894 transitions. [2019-10-15 01:10:42,982 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 894 transitions. Word has length 122 [2019-10-15 01:10:42,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:42,982 INFO L462 AbstractCegarLoop]: Abstraction has 567 states and 894 transitions. [2019-10-15 01:10:42,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:42,982 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 894 transitions. [2019-10-15 01:10:42,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 01:10:42,986 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:42,986 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:42,986 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:42,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:42,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1001725980, now seen corresponding path program 1 times [2019-10-15 01:10:42,987 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:42,987 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924682371] [2019-10-15 01:10:42,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,988 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:42,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:43,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924682371] [2019-10-15 01:10:43,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61340175] [2019-10-15 01:10:43,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:43,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:43,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 2956 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:43,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:44,058 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:44,058 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:44,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:44,191 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:44,192 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:44,192 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479659111] [2019-10-15 01:10:44,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:44,193 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:44,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:44,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:44,193 INFO L87 Difference]: Start difference. First operand 567 states and 894 transitions. Second operand 3 states. [2019-10-15 01:10:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:44,289 INFO L93 Difference]: Finished difference Result 1577 states and 2540 transitions. [2019-10-15 01:10:44,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:44,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-10-15 01:10:44,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:44,301 INFO L225 Difference]: With dead ends: 1577 [2019-10-15 01:10:44,301 INFO L226 Difference]: Without dead ends: 1044 [2019-10-15 01:10:44,305 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 248 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:44,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2019-10-15 01:10:44,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 1031. [2019-10-15 01:10:44,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-10-15 01:10:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1649 transitions. [2019-10-15 01:10:44,358 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1649 transitions. Word has length 123 [2019-10-15 01:10:44,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:44,359 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1649 transitions. [2019-10-15 01:10:44,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1649 transitions. [2019-10-15 01:10:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-15 01:10:44,364 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:44,365 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:44,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:44,575 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash -134098458, now seen corresponding path program 1 times [2019-10-15 01:10:44,576 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:44,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620642217] [2019-10-15 01:10:44,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:44,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:44,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:44,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:44,800 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:44,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620642217] [2019-10-15 01:10:44,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [151786716] [2019-10-15 01:10:44,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:45,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 2957 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:10:45,559 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:45,672 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:45,672 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:45,774 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:45,774 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:45,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 12 [2019-10-15 01:10:45,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96770086] [2019-10-15 01:10:45,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:45,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:45,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:45,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:45,776 INFO L87 Difference]: Start difference. First operand 1031 states and 1649 transitions. Second operand 3 states. [2019-10-15 01:10:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:45,877 INFO L93 Difference]: Finished difference Result 2505 states and 4052 transitions. [2019-10-15 01:10:45,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:45,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-10-15 01:10:45,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:45,891 INFO L225 Difference]: With dead ends: 2505 [2019-10-15 01:10:45,891 INFO L226 Difference]: Without dead ends: 1508 [2019-10-15 01:10:45,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 250 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:10:45,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2019-10-15 01:10:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1459. [2019-10-15 01:10:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1459 states. [2019-10-15 01:10:45,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 2357 transitions. [2019-10-15 01:10:45,966 INFO L78 Accepts]: Start accepts. Automaton has 1459 states and 2357 transitions. Word has length 124 [2019-10-15 01:10:45,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:45,966 INFO L462 AbstractCegarLoop]: Abstraction has 1459 states and 2357 transitions. [2019-10-15 01:10:45,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:45,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1459 states and 2357 transitions. [2019-10-15 01:10:45,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-10-15 01:10:45,973 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:45,973 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:46,185 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:46,185 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:46,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:46,186 INFO L82 PathProgramCache]: Analyzing trace with hash -267534477, now seen corresponding path program 1 times [2019-10-15 01:10:46,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:46,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057126207] [2019-10-15 01:10:46,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:46,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:46,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:46,346 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:46,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057126207] [2019-10-15 01:10:46,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:10:46,346 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:10:46,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573706578] [2019-10-15 01:10:46,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:10:46,347 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:46,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:10:46,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:10:46,348 INFO L87 Difference]: Start difference. First operand 1459 states and 2357 transitions. Second operand 7 states. [2019-10-15 01:10:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:49,210 INFO L93 Difference]: Finished difference Result 4299 states and 7110 transitions. [2019-10-15 01:10:49,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:10:49,211 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2019-10-15 01:10:49,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:49,243 INFO L225 Difference]: With dead ends: 4299 [2019-10-15 01:10:49,244 INFO L226 Difference]: Without dead ends: 2874 [2019-10-15 01:10:49,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:10:49,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2874 states. [2019-10-15 01:10:49,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2874 to 2804. [2019-10-15 01:10:49,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2804 states. [2019-10-15 01:10:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2804 states to 2804 states and 4625 transitions. [2019-10-15 01:10:49,449 INFO L78 Accepts]: Start accepts. Automaton has 2804 states and 4625 transitions. Word has length 126 [2019-10-15 01:10:49,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:49,450 INFO L462 AbstractCegarLoop]: Abstraction has 2804 states and 4625 transitions. [2019-10-15 01:10:49,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:10:49,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2804 states and 4625 transitions. [2019-10-15 01:10:49,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-15 01:10:49,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:49,458 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:49,458 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:49,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:49,459 INFO L82 PathProgramCache]: Analyzing trace with hash -340723709, now seen corresponding path program 1 times [2019-10-15 01:10:49,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:49,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38618487] [2019-10-15 01:10:49,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,460 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:49,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:49,676 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:49,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38618487] [2019-10-15 01:10:49,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431201959] [2019-10-15 01:10:49,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:50,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:50,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 2975 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-15 01:10:50,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:50,386 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:50,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:50,536 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:50,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [11] total 14 [2019-10-15 01:10:50,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046006293] [2019-10-15 01:10:50,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:10:50,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:50,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:10:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:50,541 INFO L87 Difference]: Start difference. First operand 2804 states and 4625 transitions. Second operand 5 states. [2019-10-15 01:10:52,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:52,636 INFO L93 Difference]: Finished difference Result 12876 states and 21499 transitions. [2019-10-15 01:10:52,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:10:52,636 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2019-10-15 01:10:52,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:52,729 INFO L225 Difference]: With dead ends: 12876 [2019-10-15 01:10:52,729 INFO L226 Difference]: Without dead ends: 10107 [2019-10-15 01:10:52,755 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 254 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:10:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10107 states. [2019-10-15 01:10:53,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10107 to 9987. [2019-10-15 01:10:53,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9987 states. [2019-10-15 01:10:53,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9987 states to 9987 states and 16352 transitions. [2019-10-15 01:10:53,298 INFO L78 Accepts]: Start accepts. Automaton has 9987 states and 16352 transitions. Word has length 127 [2019-10-15 01:10:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:53,298 INFO L462 AbstractCegarLoop]: Abstraction has 9987 states and 16352 transitions. [2019-10-15 01:10:53,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:10:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 9987 states and 16352 transitions. [2019-10-15 01:10:53,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:10:53,305 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:53,305 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:53,514 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:53,514 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:53,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:53,515 INFO L82 PathProgramCache]: Analyzing trace with hash 474491256, now seen corresponding path program 1 times [2019-10-15 01:10:53,515 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:53,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035383663] [2019-10-15 01:10:53,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:53,522 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:53,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:53,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:53,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:53,800 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035383663] [2019-10-15 01:10:53,801 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055944758] [2019-10-15 01:10:53,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:54,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:54,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 2989 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-15 01:10:54,956 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:54,971 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:55,063 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:55,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [11] total 11 [2019-10-15 01:10:55,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000826552] [2019-10-15 01:10:55,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:10:55,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:55,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:10:55,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:10:55,066 INFO L87 Difference]: Start difference. First operand 9987 states and 16352 transitions. Second operand 3 states. [2019-10-15 01:10:55,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:10:55,629 INFO L93 Difference]: Finished difference Result 27678 states and 45753 transitions. [2019-10-15 01:10:55,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:10:55,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-15 01:10:55,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:10:55,848 INFO L225 Difference]: With dead ends: 27678 [2019-10-15 01:10:55,848 INFO L226 Difference]: Without dead ends: 17810 [2019-10-15 01:10:55,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:10:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17810 states. [2019-10-15 01:10:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17810 to 17644. [2019-10-15 01:10:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17644 states. [2019-10-15 01:10:56,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17644 states to 17644 states and 28913 transitions. [2019-10-15 01:10:56,740 INFO L78 Accepts]: Start accepts. Automaton has 17644 states and 28913 transitions. Word has length 132 [2019-10-15 01:10:56,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:10:56,741 INFO L462 AbstractCegarLoop]: Abstraction has 17644 states and 28913 transitions. [2019-10-15 01:10:56,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:10:56,741 INFO L276 IsEmpty]: Start isEmpty. Operand 17644 states and 28913 transitions. [2019-10-15 01:10:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:10:56,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:10:56,747 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:10:56,957 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:56,958 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:10:56,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:10:56,959 INFO L82 PathProgramCache]: Analyzing trace with hash -805372422, now seen corresponding path program 1 times [2019-10-15 01:10:56,959 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:10:56,959 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461597587] [2019-10-15 01:10:56,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:56,959 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:10:56,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:10:57,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:10:57,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461597587] [2019-10-15 01:10:57,166 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120468720] [2019-10-15 01:10:57,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:10:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:10:57,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 2988 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-15 01:10:57,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:10:57,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:10:57,747 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:10:57,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:10:58,006 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:10:58,006 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:10:58,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 7] imperfect sequences [11] total 20 [2019-10-15 01:10:58,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386551963] [2019-10-15 01:10:58,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-15 01:10:58,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:10:58,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-15 01:10:58,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-10-15 01:10:58,008 INFO L87 Difference]: Start difference. First operand 17644 states and 28913 transitions. Second operand 11 states. [2019-10-15 01:11:02,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:11:02,256 INFO L93 Difference]: Finished difference Result 44110 states and 73008 transitions. [2019-10-15 01:11:02,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-15 01:11:02,257 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 132 [2019-10-15 01:11:02,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:11:02,454 INFO L225 Difference]: With dead ends: 44110 [2019-10-15 01:11:02,454 INFO L226 Difference]: Without dead ends: 26500 [2019-10-15 01:11:02,539 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 256 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=440, Unknown=0, NotChecked=0, Total=506 [2019-10-15 01:11:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26500 states. [2019-10-15 01:11:03,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26500 to 26428. [2019-10-15 01:11:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26428 states. [2019-10-15 01:11:03,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26428 states to 26428 states and 43046 transitions. [2019-10-15 01:11:03,611 INFO L78 Accepts]: Start accepts. Automaton has 26428 states and 43046 transitions. Word has length 132 [2019-10-15 01:11:03,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:11:03,612 INFO L462 AbstractCegarLoop]: Abstraction has 26428 states and 43046 transitions. [2019-10-15 01:11:03,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-15 01:11:03,612 INFO L276 IsEmpty]: Start isEmpty. Operand 26428 states and 43046 transitions. [2019-10-15 01:11:03,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-15 01:11:03,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:11:03,617 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:11:03,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:11:03,824 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:11:03,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:11:03,825 INFO L82 PathProgramCache]: Analyzing trace with hash 757651711, now seen corresponding path program 1 times [2019-10-15 01:11:03,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:11:03,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153113455] [2019-10-15 01:11:03,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:03,826 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:11:03,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:11:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:11:04,927 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:11:04,927 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153113455] [2019-10-15 01:11:04,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:11:04,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:11:04,928 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675732744] [2019-10-15 01:11:04,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:11:04,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:11:04,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:11:04,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:11:04,930 INFO L87 Difference]: Start difference. First operand 26428 states and 43046 transitions. Second operand 4 states.