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_spec14_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:08:09,509 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:08:09,511 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:08:09,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:08:09,532 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:08:09,533 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:08:09,535 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:08:09,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:08:09,549 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:08:09,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:08:09,554 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:08:09,556 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:08:09,556 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:08:09,558 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:08:09,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:08:09,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:08:09,563 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:08:09,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:08:09,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:08:09,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:08:09,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:08:09,582 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:08:09,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:08:09,587 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:08:09,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:08:09,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:08:09,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:08:09,592 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:08:09,594 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:08:09,595 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:08:09,595 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:08:09,597 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:08:09,598 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:08:09,598 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:08:09,600 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:08:09,600 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:08:09,600 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:08:09,601 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:08:09,601 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:08:09,602 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:08:09,603 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:08:09,604 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:08:09,626 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:08:09,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:08:09,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:08:09,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:08:09,632 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:08:09,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:08:09,632 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:08:09,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:08:09,633 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:08:09,633 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:08:09,633 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:08:09,634 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:08:09,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:08:09,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:08:09,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:08:09,635 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:08:09,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:08:09,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:08:09,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:08:09,637 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:08:09,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:08:09,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:08:09,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:08:09,638 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:08:09,638 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:08:09,638 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:08:09,639 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:08:09,639 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:08:09,639 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:08:09,977 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:08:10,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:08:10,003 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:08:10,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:08:10,006 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:08:10,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-10-15 01:08:10,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f6c6499/9d4ae5536b52436d8263e81e5a29dad5/FLAGdbc41953a [2019-10-15 01:08:10,680 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:08:10,682 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-10-15 01:08:10,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f6c6499/9d4ae5536b52436d8263e81e5a29dad5/FLAGdbc41953a [2019-10-15 01:08:10,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1f6c6499/9d4ae5536b52436d8263e81e5a29dad5 [2019-10-15 01:08:10,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:08:10,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:08:10,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:11,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:08:11,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:08:11,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:10" (1/1) ... [2019-10-15 01:08:11,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661e0db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11, skipping insertion in model container [2019-10-15 01:08:11,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:08:10" (1/1) ... [2019-10-15 01:08:11,016 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:08:11,098 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:08:11,762 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:11,782 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:08:11,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:08:11,946 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:08:11,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11 WrapperNode [2019-10-15 01:08:11,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:08:11,947 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:08:11,947 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:08:11,947 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:08:11,961 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (1/1) ... [2019-10-15 01:08:11,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (1/1) ... [2019-10-15 01:08:11,992 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (1/1) ... [2019-10-15 01:08:11,993 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (1/1) ... [2019-10-15 01:08:12,052 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (1/1) ... [2019-10-15 01:08:12,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (1/1) ... [2019-10-15 01:08:12,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (1/1) ... [2019-10-15 01:08:12,115 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:08:12,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:08:12,116 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:08:12,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:08:12,117 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (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:08:12,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:08:12,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:08:12,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:12,199 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:08:12,199 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:08:12,200 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:08:12,200 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:08:12,200 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:08:12,200 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:08:12,201 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:08:12,201 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:08:12,201 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:08:12,201 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:08:12,201 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:08:12,202 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:08:12,202 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:08:12,202 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:08:12,202 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:08:12,203 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:08:12,203 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:08:12,203 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:08:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:08:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:08:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:08:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:12,204 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:08:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:08:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:08:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:08:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:08:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-15 01:08:12,205 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-15 01:08:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:08:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:08:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:08:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:12,206 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:08:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:08:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:08:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:08:12,207 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:08:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:08:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:08:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:08:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:08:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:08:12,208 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:08:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:08:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:08:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:08:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:08:12,209 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:08:12,210 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:08:12,210 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:08:12,210 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:08:12,210 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:08:12,210 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:08:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:08:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:08:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:08:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:08:12,211 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:08:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:08:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:08:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:08:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:08:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:08:12,212 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:08:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:08:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:08:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:08:12,213 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:08:12,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:08:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:08:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:08:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:08:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:08:12,214 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:08:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:08:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:08:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:08:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:08:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:08:12,215 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:08:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:08:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:08:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:08:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:08:12,216 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:08:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:08:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:08:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:08:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:08:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:08:12,217 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:08:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-15 01:08:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-15 01:08:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:08:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:08:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:08:12,218 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:08:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:08:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:08:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:08:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-15 01:08:12,219 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:08:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:08:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-15 01:08:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:08:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:08:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:08:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-15 01:08:12,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:08:12,221 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:08:12,221 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:08:12,221 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:08:12,221 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:08:12,221 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:08:12,221 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:08:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:08:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:08:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:08:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:08:12,222 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:08:12,223 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:08:12,223 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:08:12,223 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:08:12,223 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:08:12,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:08:12,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:08:12,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:08:12,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:08:12,224 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:08:12,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:08:12,224 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:08:12,224 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:08:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:08:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:08:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:08:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:08:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:08:12,225 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:08:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:08:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:08:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:08:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:08:12,226 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:08:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:08:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:08:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:08:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:08:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:08:12,227 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:08:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:08:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:08:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:08:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:08:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:08:12,228 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:08:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:08:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:08:12,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:08:14,946 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:08:14,946 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:08:14,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:14 BoogieIcfgContainer [2019-10-15 01:08:14,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:08:14,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:08:14,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:08:14,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:08:14,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:08:10" (1/3) ... [2019-10-15 01:08:14,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655619e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:14, skipping insertion in model container [2019-10-15 01:08:14,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:08:11" (2/3) ... [2019-10-15 01:08:14,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@655619e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:08:14, skipping insertion in model container [2019-10-15 01:08:14,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:08:14" (3/3) ... [2019-10-15 01:08:14,960 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product19.cil.c [2019-10-15 01:08:14,972 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:08:14,987 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:08:14,999 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:08:15,055 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:08:15,055 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:08:15,056 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:08:15,056 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:08:15,056 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:08:15,056 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:08:15,056 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:08:15,056 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:08:15,104 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states. [2019-10-15 01:08:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-15 01:08:15,137 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:15,138 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:15,141 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:15,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:15,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1411507135, now seen corresponding path program 1 times [2019-10-15 01:08:15,159 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:15,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929371770] [2019-10-15 01:08:15,159 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,160 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:15,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:15,888 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:15,889 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929371770] [2019-10-15 01:08:15,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:15,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:15,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743910181] [2019-10-15 01:08:15,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:15,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:15,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:15,915 INFO L87 Difference]: Start difference. First operand 735 states. Second operand 4 states. [2019-10-15 01:08:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:16,147 INFO L93 Difference]: Finished difference Result 1168 states and 1874 transitions. [2019-10-15 01:08:16,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:16,149 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-15 01:08:16,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:16,192 INFO L225 Difference]: With dead ends: 1168 [2019-10-15 01:08:16,192 INFO L226 Difference]: Without dead ends: 587 [2019-10-15 01:08:16,207 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:08:16,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-15 01:08:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-15 01:08:16,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 01:08:16,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 928 transitions. [2019-10-15 01:08:16,342 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 928 transitions. Word has length 135 [2019-10-15 01:08:16,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:16,343 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 928 transitions. [2019-10-15 01:08:16,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:16,343 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 928 transitions. [2019-10-15 01:08:16,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-15 01:08:16,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:16,359 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:16,360 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:16,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1349279833, now seen corresponding path program 1 times [2019-10-15 01:08:16,360 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:16,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194900037] [2019-10-15 01:08:16,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,361 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:16,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:16,633 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:16,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194900037] [2019-10-15 01:08:16,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:16,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:16,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210606494] [2019-10-15 01:08:16,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:16,637 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:16,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:16,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:16,640 INFO L87 Difference]: Start difference. First operand 587 states and 928 transitions. Second operand 4 states. [2019-10-15 01:08:16,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:16,735 INFO L93 Difference]: Finished difference Result 1141 states and 1817 transitions. [2019-10-15 01:08:16,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:16,736 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-15 01:08:16,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:16,742 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:08:16,743 INFO L226 Difference]: Without dead ends: 587 [2019-10-15 01:08:16,747 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:08:16,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-15 01:08:16,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-15 01:08:16,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 01:08:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 927 transitions. [2019-10-15 01:08:16,833 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 927 transitions. Word has length 136 [2019-10-15 01:08:16,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:16,839 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 927 transitions. [2019-10-15 01:08:16,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:16,840 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 927 transitions. [2019-10-15 01:08:16,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-15 01:08:16,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:16,851 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:16,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:16,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:16,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1382966461, now seen corresponding path program 1 times [2019-10-15 01:08:16,858 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:16,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723385167] [2019-10-15 01:08:16,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,859 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:16,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:17,053 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723385167] [2019-10-15 01:08:17,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:17,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:17,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576699617] [2019-10-15 01:08:17,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:17,058 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:17,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:17,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:17,059 INFO L87 Difference]: Start difference. First operand 587 states and 927 transitions. Second operand 4 states. [2019-10-15 01:08:17,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:17,149 INFO L93 Difference]: Finished difference Result 1141 states and 1816 transitions. [2019-10-15 01:08:17,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:17,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-15 01:08:17,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:17,158 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:08:17,158 INFO L226 Difference]: Without dead ends: 587 [2019-10-15 01:08:17,162 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:08:17,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-15 01:08:17,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-15 01:08:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 01:08:17,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 926 transitions. [2019-10-15 01:08:17,209 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 926 transitions. Word has length 137 [2019-10-15 01:08:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:17,209 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 926 transitions. [2019-10-15 01:08:17,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:17,210 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 926 transitions. [2019-10-15 01:08:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 01:08:17,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:17,217 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:17,217 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:17,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1519078827, now seen corresponding path program 1 times [2019-10-15 01:08:17,218 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:17,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816427243] [2019-10-15 01:08:17,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,219 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:17,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:17,357 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:17,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816427243] [2019-10-15 01:08:17,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:17,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:17,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579243222] [2019-10-15 01:08:17,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:17,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:17,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:17,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:17,361 INFO L87 Difference]: Start difference. First operand 587 states and 926 transitions. Second operand 4 states. [2019-10-15 01:08:17,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:17,443 INFO L93 Difference]: Finished difference Result 1141 states and 1815 transitions. [2019-10-15 01:08:17,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:17,444 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-15 01:08:17,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:17,452 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:08:17,452 INFO L226 Difference]: Without dead ends: 587 [2019-10-15 01:08:17,458 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:08:17,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-15 01:08:17,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-15 01:08:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 01:08:17,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 925 transitions. [2019-10-15 01:08:17,498 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 925 transitions. Word has length 138 [2019-10-15 01:08:17,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:17,499 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 925 transitions. [2019-10-15 01:08:17,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:17,499 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 925 transitions. [2019-10-15 01:08:17,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-15 01:08:17,504 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:17,505 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:17,505 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:17,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash -939532999, now seen corresponding path program 1 times [2019-10-15 01:08:17,506 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:17,506 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905475641] [2019-10-15 01:08:17,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,507 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:17,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:17,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905475641] [2019-10-15 01:08:17,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:17,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:17,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971102373] [2019-10-15 01:08:17,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:17,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:17,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:17,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:17,747 INFO L87 Difference]: Start difference. First operand 587 states and 925 transitions. Second operand 4 states. [2019-10-15 01:08:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:17,815 INFO L93 Difference]: Finished difference Result 1141 states and 1814 transitions. [2019-10-15 01:08:17,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:08:17,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-15 01:08:17,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:17,824 INFO L225 Difference]: With dead ends: 1141 [2019-10-15 01:08:17,825 INFO L226 Difference]: Without dead ends: 587 [2019-10-15 01:08:17,828 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:08:17,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-15 01:08:17,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-15 01:08:17,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 01:08:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 924 transitions. [2019-10-15 01:08:17,856 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 924 transitions. Word has length 139 [2019-10-15 01:08:17,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:17,857 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 924 transitions. [2019-10-15 01:08:17,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 924 transitions. [2019-10-15 01:08:17,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:08:17,863 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:17,864 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:17,864 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:17,865 INFO L82 PathProgramCache]: Analyzing trace with hash 195155025, now seen corresponding path program 1 times [2019-10-15 01:08:17,866 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:17,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225302675] [2019-10-15 01:08:17,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,869 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:17,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:18,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225302675] [2019-10-15 01:08:18,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:18,073 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:08:18,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632601394] [2019-10-15 01:08:18,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:08:18,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:18,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:08:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:08:18,076 INFO L87 Difference]: Start difference. First operand 587 states and 924 transitions. Second operand 10 states. [2019-10-15 01:08:18,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:18,274 INFO L93 Difference]: Finished difference Result 1146 states and 1821 transitions. [2019-10-15 01:08:18,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:08:18,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-15 01:08:18,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:18,281 INFO L225 Difference]: With dead ends: 1146 [2019-10-15 01:08:18,281 INFO L226 Difference]: Without dead ends: 596 [2019-10-15 01:08:18,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-15 01:08:18,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2019-10-15 01:08:18,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-15 01:08:18,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 934 transitions. [2019-10-15 01:08:18,316 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 934 transitions. Word has length 140 [2019-10-15 01:08:18,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:18,316 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 934 transitions. [2019-10-15 01:08:18,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:08:18,317 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 934 transitions. [2019-10-15 01:08:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-15 01:08:18,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:18,321 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:18,322 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:18,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:18,322 INFO L82 PathProgramCache]: Analyzing trace with hash -791427664, now seen corresponding path program 1 times [2019-10-15 01:08:18,323 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:18,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907713600] [2019-10-15 01:08:18,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:18,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:18,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:18,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:18,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907713600] [2019-10-15 01:08:18,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:18,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:08:18,493 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37014255] [2019-10-15 01:08:18,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:08:18,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:18,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:08:18,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:08:18,494 INFO L87 Difference]: Start difference. First operand 594 states and 934 transitions. Second operand 4 states. [2019-10-15 01:08:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:18,562 INFO L93 Difference]: Finished difference Result 1147 states and 1822 transitions. [2019-10-15 01:08:18,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:08:18,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-15 01:08:18,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:18,569 INFO L225 Difference]: With dead ends: 1147 [2019-10-15 01:08:18,569 INFO L226 Difference]: Without dead ends: 590 [2019-10-15 01:08:18,573 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:08:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-15 01:08:18,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-15 01:08:18,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-15 01:08:18,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 927 transitions. [2019-10-15 01:08:18,598 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 927 transitions. Word has length 140 [2019-10-15 01:08:18,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:18,598 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 927 transitions. [2019-10-15 01:08:18,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:08:18,598 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 927 transitions. [2019-10-15 01:08:18,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-15 01:08:18,603 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:18,604 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:18,604 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:18,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:18,604 INFO L82 PathProgramCache]: Analyzing trace with hash -306965809, now seen corresponding path program 1 times [2019-10-15 01:08:18,605 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:18,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256877870] [2019-10-15 01:08:18,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:18,605 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:18,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:18,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:18,763 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:18,763 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256877870] [2019-10-15 01:08:18,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:18,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:18,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472142064] [2019-10-15 01:08:18,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:18,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:18,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:18,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:18,766 INFO L87 Difference]: Start difference. First operand 590 states and 927 transitions. Second operand 6 states. [2019-10-15 01:08:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:19,119 INFO L93 Difference]: Finished difference Result 1160 states and 1846 transitions. [2019-10-15 01:08:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:08:19,120 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-15 01:08:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:19,127 INFO L225 Difference]: With dead ends: 1160 [2019-10-15 01:08:19,127 INFO L226 Difference]: Without dead ends: 598 [2019-10-15 01:08:19,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:19,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-15 01:08:19,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2019-10-15 01:08:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-15 01:08:19,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 928 transitions. [2019-10-15 01:08:19,158 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 928 transitions. Word has length 141 [2019-10-15 01:08:19,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:19,159 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 928 transitions. [2019-10-15 01:08:19,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:19,159 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 928 transitions. [2019-10-15 01:08:19,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-15 01:08:19,164 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:19,164 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:19,165 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash 394745588, now seen corresponding path program 1 times [2019-10-15 01:08:19,166 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:19,166 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337102329] [2019-10-15 01:08:19,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,166 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:19,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:19,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337102329] [2019-10-15 01:08:19,325 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:19,325 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:19,326 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820303720] [2019-10-15 01:08:19,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:19,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:19,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:19,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:19,327 INFO L87 Difference]: Start difference. First operand 595 states and 928 transitions. Second operand 6 states. [2019-10-15 01:08:19,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:19,658 INFO L93 Difference]: Finished difference Result 1123 states and 1761 transitions. [2019-10-15 01:08:19,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:19,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-15 01:08:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:19,671 INFO L225 Difference]: With dead ends: 1123 [2019-10-15 01:08:19,671 INFO L226 Difference]: Without dead ends: 595 [2019-10-15 01:08:19,677 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:19,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-15 01:08:19,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-15 01:08:19,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-15 01:08:19,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 924 transitions. [2019-10-15 01:08:19,714 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 924 transitions. Word has length 142 [2019-10-15 01:08:19,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:19,714 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 924 transitions. [2019-10-15 01:08:19,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:19,715 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 924 transitions. [2019-10-15 01:08:19,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:08:19,722 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:19,722 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:19,723 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:19,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:19,723 INFO L82 PathProgramCache]: Analyzing trace with hash -447409932, now seen corresponding path program 1 times [2019-10-15 01:08:19,724 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:19,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449527385] [2019-10-15 01:08:19,724 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,725 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:19,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:19,964 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:19,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449527385] [2019-10-15 01:08:19,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:19,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:19,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974454927] [2019-10-15 01:08:19,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:19,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:19,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:19,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:19,970 INFO L87 Difference]: Start difference. First operand 595 states and 924 transitions. Second operand 6 states. [2019-10-15 01:08:20,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:20,317 INFO L93 Difference]: Finished difference Result 1123 states and 1757 transitions. [2019-10-15 01:08:20,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:20,317 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-15 01:08:20,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:20,324 INFO L225 Difference]: With dead ends: 1123 [2019-10-15 01:08:20,324 INFO L226 Difference]: Without dead ends: 595 [2019-10-15 01:08:20,334 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-15 01:08:20,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-15 01:08:20,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-15 01:08:20,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 920 transitions. [2019-10-15 01:08:20,369 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 920 transitions. Word has length 143 [2019-10-15 01:08:20,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:20,370 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 920 transitions. [2019-10-15 01:08:20,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:20,370 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 920 transitions. [2019-10-15 01:08:20,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:08:20,377 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:20,378 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:20,378 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:20,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:20,379 INFO L82 PathProgramCache]: Analyzing trace with hash -170078860, now seen corresponding path program 1 times [2019-10-15 01:08:20,379 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:20,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520139141] [2019-10-15 01:08:20,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:20,615 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:20,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520139141] [2019-10-15 01:08:20,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:20,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:08:20,617 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411011689] [2019-10-15 01:08:20,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:08:20,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:20,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:08:20,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:08:20,620 INFO L87 Difference]: Start difference. First operand 595 states and 920 transitions. Second operand 7 states. [2019-10-15 01:08:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:20,785 INFO L93 Difference]: Finished difference Result 1126 states and 1757 transitions. [2019-10-15 01:08:20,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:20,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-15 01:08:20,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:20,796 INFO L225 Difference]: With dead ends: 1126 [2019-10-15 01:08:20,797 INFO L226 Difference]: Without dead ends: 577 [2019-10-15 01:08:20,801 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:08:20,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-15 01:08:20,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-10-15 01:08:20,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:08:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 883 transitions. [2019-10-15 01:08:20,838 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 883 transitions. Word has length 143 [2019-10-15 01:08:20,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:20,838 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 883 transitions. [2019-10-15 01:08:20,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:08:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 883 transitions. [2019-10-15 01:08:20,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-15 01:08:20,847 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:20,848 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:20,848 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:20,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:20,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1904799623, now seen corresponding path program 1 times [2019-10-15 01:08:20,849 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:20,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357932060] [2019-10-15 01:08:20,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,850 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:20,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:20,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:21,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357932060] [2019-10-15 01:08:21,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:21,101 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:21,101 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981688118] [2019-10-15 01:08:21,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:21,103 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:21,104 INFO L87 Difference]: Start difference. First operand 574 states and 883 transitions. Second operand 6 states. [2019-10-15 01:08:21,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:21,249 INFO L93 Difference]: Finished difference Result 1102 states and 1716 transitions. [2019-10-15 01:08:21,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:21,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-15 01:08:21,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:21,256 INFO L225 Difference]: With dead ends: 1102 [2019-10-15 01:08:21,257 INFO L226 Difference]: Without dead ends: 574 [2019-10-15 01:08:21,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:21,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-15 01:08:21,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-15 01:08:21,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:08:21,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-10-15 01:08:21,292 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 144 [2019-10-15 01:08:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:21,293 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-10-15 01:08:21,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-10-15 01:08:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:08:21,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:21,301 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:21,302 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash -959612135, now seen corresponding path program 1 times [2019-10-15 01:08:21,302 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:21,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227657825] [2019-10-15 01:08:21,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:21,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227657825] [2019-10-15 01:08:21,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:21,461 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:08:21,461 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395256434] [2019-10-15 01:08:21,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:21,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:21,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:21,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:08:21,463 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 6 states. [2019-10-15 01:08:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:21,639 INFO L93 Difference]: Finished difference Result 1102 states and 1715 transitions. [2019-10-15 01:08:21,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:21,640 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-15 01:08:21,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:21,648 INFO L225 Difference]: With dead ends: 1102 [2019-10-15 01:08:21,648 INFO L226 Difference]: Without dead ends: 574 [2019-10-15 01:08:21,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:08:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-15 01:08:21,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-15 01:08:21,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-15 01:08:21,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 881 transitions. [2019-10-15 01:08:21,690 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 881 transitions. Word has length 145 [2019-10-15 01:08:21,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:21,692 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 881 transitions. [2019-10-15 01:08:21,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 881 transitions. [2019-10-15 01:08:21,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-15 01:08:21,702 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:21,702 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:21,702 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:21,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1451023870, now seen corresponding path program 1 times [2019-10-15 01:08:21,704 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:21,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457895530] [2019-10-15 01:08:21,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:21,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-15 01:08:21,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457895530] [2019-10-15 01:08:21,971 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:21,971 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:08:21,971 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937989087] [2019-10-15 01:08:21,972 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:08:21,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:21,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:08:21,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:08:21,973 INFO L87 Difference]: Start difference. First operand 574 states and 881 transitions. Second operand 12 states. [2019-10-15 01:08:22,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:22,289 INFO L93 Difference]: Finished difference Result 1108 states and 1725 transitions. [2019-10-15 01:08:22,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:08:22,290 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-15 01:08:22,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:22,296 INFO L225 Difference]: With dead ends: 1108 [2019-10-15 01:08:22,296 INFO L226 Difference]: Without dead ends: 581 [2019-10-15 01:08:22,302 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:22,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-15 01:08:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2019-10-15 01:08:22,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-15 01:08:22,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 887 transitions. [2019-10-15 01:08:22,336 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 887 transitions. Word has length 146 [2019-10-15 01:08:22,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:22,340 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 887 transitions. [2019-10-15 01:08:22,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:08:22,341 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 887 transitions. [2019-10-15 01:08:22,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-15 01:08:22,349 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:22,349 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:22,349 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:22,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:22,350 INFO L82 PathProgramCache]: Analyzing trace with hash 457980586, now seen corresponding path program 1 times [2019-10-15 01:08:22,350 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:22,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563411745] [2019-10-15 01:08:22,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:22,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:08:22,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563411745] [2019-10-15 01:08:22,676 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784007902] [2019-10-15 01:08:22,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 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:08:23,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:23,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:23,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:23,361 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:08:23,361 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-15 01:08:23,725 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:23,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-15 01:08:23,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919787354] [2019-10-15 01:08:23,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:23,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:23,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:23,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:23,729 INFO L87 Difference]: Start difference. First operand 579 states and 887 transitions. Second operand 5 states. [2019-10-15 01:08:24,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:24,826 INFO L93 Difference]: Finished difference Result 1113 states and 1758 transitions. [2019-10-15 01:08:24,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:24,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-15 01:08:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:24,832 INFO L225 Difference]: With dead ends: 1113 [2019-10-15 01:08:24,832 INFO L226 Difference]: Without dead ends: 587 [2019-10-15 01:08:24,842 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:08:24,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-15 01:08:24,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-15 01:08:24,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-15 01:08:24,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 900 transitions. [2019-10-15 01:08:24,877 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 900 transitions. Word has length 147 [2019-10-15 01:08:24,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:24,878 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 900 transitions. [2019-10-15 01:08:24,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:24,878 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 900 transitions. [2019-10-15 01:08:24,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:08:24,882 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:24,882 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:25,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:25,090 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1382783305, now seen corresponding path program 1 times [2019-10-15 01:08:25,091 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:25,091 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348671126] [2019-10-15 01:08:25,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:25,092 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:25,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-15 01:08:25,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348671126] [2019-10-15 01:08:25,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:08:25,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:08:25,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818899631] [2019-10-15 01:08:25,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:08:25,323 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:25,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:08:25,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:08:25,323 INFO L87 Difference]: Start difference. First operand 587 states and 900 transitions. Second operand 3 states. [2019-10-15 01:08:25,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:25,371 INFO L93 Difference]: Finished difference Result 1294 states and 1986 transitions. [2019-10-15 01:08:25,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:08:25,371 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-15 01:08:25,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:25,378 INFO L225 Difference]: With dead ends: 1294 [2019-10-15 01:08:25,378 INFO L226 Difference]: Without dead ends: 760 [2019-10-15 01:08:25,381 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:08:25,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-10-15 01:08:25,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 757. [2019-10-15 01:08:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-10-15 01:08:25,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1135 transitions. [2019-10-15 01:08:25,424 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1135 transitions. Word has length 150 [2019-10-15 01:08:25,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:25,425 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1135 transitions. [2019-10-15 01:08:25,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:08:25,425 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1135 transitions. [2019-10-15 01:08:25,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-15 01:08:25,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:25,429 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:25,429 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:25,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:25,430 INFO L82 PathProgramCache]: Analyzing trace with hash 2114750731, now seen corresponding path program 1 times [2019-10-15 01:08:25,430 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:25,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423866920] [2019-10-15 01:08:25,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:25,431 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:25,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:25,635 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:08:25,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423866920] [2019-10-15 01:08:25,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621704991] [2019-10-15 01:08:25,636 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:08:26,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:26,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:26,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:26,543 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:08:26,543 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:26,977 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-15 01:08:26,978 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:26,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-15 01:08:26,978 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505669534] [2019-10-15 01:08:26,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:26,979 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:26,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:26,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:08:26,980 INFO L87 Difference]: Start difference. First operand 757 states and 1135 transitions. Second operand 5 states. [2019-10-15 01:08:27,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:27,920 INFO L93 Difference]: Finished difference Result 1477 states and 2286 transitions. [2019-10-15 01:08:27,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:27,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-15 01:08:27,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:27,928 INFO L225 Difference]: With dead ends: 1477 [2019-10-15 01:08:27,928 INFO L226 Difference]: Without dead ends: 773 [2019-10-15 01:08:27,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:27,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-15 01:08:27,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2019-10-15 01:08:27,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-15 01:08:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1161 transitions. [2019-10-15 01:08:27,973 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1161 transitions. Word has length 150 [2019-10-15 01:08:27,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:27,974 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1161 transitions. [2019-10-15 01:08:27,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:27,974 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1161 transitions. [2019-10-15 01:08:27,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-15 01:08:27,978 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:27,979 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:28,186 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:28,186 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:28,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:28,187 INFO L82 PathProgramCache]: Analyzing trace with hash 395684240, now seen corresponding path program 1 times [2019-10-15 01:08:28,188 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:28,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456674030] [2019-10-15 01:08:28,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:28,189 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:28,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:28,369 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-15 01:08:28,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456674030] [2019-10-15 01:08:28,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598879247] [2019-10-15 01:08:28,370 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:08:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:29,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 2637 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:29,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:29,178 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:08:29,178 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:29,500 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-15 01:08:29,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:29,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-15 01:08:29,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530252631] [2019-10-15 01:08:29,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:29,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:29,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:29,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:29,502 INFO L87 Difference]: Start difference. First operand 773 states and 1161 transitions. Second operand 5 states. [2019-10-15 01:08:30,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:30,380 INFO L93 Difference]: Finished difference Result 1509 states and 2334 transitions. [2019-10-15 01:08:30,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:30,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-15 01:08:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:30,388 INFO L225 Difference]: With dead ends: 1509 [2019-10-15 01:08:30,388 INFO L226 Difference]: Without dead ends: 789 [2019-10-15 01:08:30,393 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-15 01:08:30,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-15 01:08:30,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2019-10-15 01:08:30,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-15 01:08:30,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1187 transitions. [2019-10-15 01:08:30,433 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1187 transitions. Word has length 153 [2019-10-15 01:08:30,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:30,434 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1187 transitions. [2019-10-15 01:08:30,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:30,434 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1187 transitions. [2019-10-15 01:08:30,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-15 01:08:30,439 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:30,439 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:30,649 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:30,650 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:30,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:30,650 INFO L82 PathProgramCache]: Analyzing trace with hash 110325351, now seen corresponding path program 1 times [2019-10-15 01:08:30,650 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:30,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788441589] [2019-10-15 01:08:30,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:30,651 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:30,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:30,835 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-15 01:08:30,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788441589] [2019-10-15 01:08:30,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654176460] [2019-10-15 01:08:30,835 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:08:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:31,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-15 01:08:31,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:31,451 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:08:31,451 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-15 01:08:31,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:31,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 16 [2019-10-15 01:08:31,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669758088] [2019-10-15 01:08:31,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:08:31,725 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:31,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:08:31,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-15 01:08:31,726 INFO L87 Difference]: Start difference. First operand 789 states and 1187 transitions. Second operand 5 states. [2019-10-15 01:08:32,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:32,600 INFO L93 Difference]: Finished difference Result 1541 states and 2382 transitions. [2019-10-15 01:08:32,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:08:32,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-15 01:08:32,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:32,609 INFO L225 Difference]: With dead ends: 1541 [2019-10-15 01:08:32,609 INFO L226 Difference]: Without dead ends: 805 [2019-10-15 01:08:32,615 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 312 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-10-15 01:08:32,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2019-10-15 01:08:32,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-10-15 01:08:32,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1213 transitions. [2019-10-15 01:08:32,655 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1213 transitions. Word has length 156 [2019-10-15 01:08:32,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:32,656 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1213 transitions. [2019-10-15 01:08:32,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:08:32,656 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1213 transitions. [2019-10-15 01:08:32,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-15 01:08:32,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:32,660 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:32,876 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:32,876 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:32,877 INFO L82 PathProgramCache]: Analyzing trace with hash -638133708, now seen corresponding path program 1 times [2019-10-15 01:08:32,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:32,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295797720] [2019-10-15 01:08:32,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:32,881 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:32,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:33,048 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:08:33,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295797720] [2019-10-15 01:08:33,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32967323] [2019-10-15 01:08:33,049 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:08:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:33,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 2643 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-15 01:08:33,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:08:33,714 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:33,859 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:08:33,859 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:08:33,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-15 01:08:33,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471217078] [2019-10-15 01:08:33,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:08:33,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:33,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:08:33,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:08:33,862 INFO L87 Difference]: Start difference. First operand 805 states and 1213 transitions. Second operand 6 states. [2019-10-15 01:08:34,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:34,635 INFO L93 Difference]: Finished difference Result 2313 states and 3577 transitions. [2019-10-15 01:08:34,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:08:34,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-15 01:08:34,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:34,646 INFO L225 Difference]: With dead ends: 2313 [2019-10-15 01:08:34,647 INFO L226 Difference]: Without dead ends: 1562 [2019-10-15 01:08:34,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:08:34,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-10-15 01:08:34,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1553. [2019-10-15 01:08:34,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-10-15 01:08:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2382 transitions. [2019-10-15 01:08:34,734 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2382 transitions. Word has length 159 [2019-10-15 01:08:34,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:34,735 INFO L462 AbstractCegarLoop]: Abstraction has 1553 states and 2382 transitions. [2019-10-15 01:08:34,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:08:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2382 transitions. [2019-10-15 01:08:34,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:08:34,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:34,740 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:34,947 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:34,947 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:34,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash -842544841, now seen corresponding path program 1 times [2019-10-15 01:08:34,948 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:34,948 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27261143] [2019-10-15 01:08:34,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:34,948 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:34,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:35,106 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:08:35,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27261143] [2019-10-15 01:08:35,107 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304657880] [2019-10-15 01:08:35,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:35,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:35,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-15 01:08:35,623 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:35,708 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-15 01:08:35,710 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:35,812 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-15 01:08:35,813 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:08:35,813 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-15 01:08:35,814 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954955451] [2019-10-15 01:08:35,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:08:35,815 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:35,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:08:35,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:35,817 INFO L87 Difference]: Start difference. First operand 1553 states and 2382 transitions. Second operand 3 states. [2019-10-15 01:08:35,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:08:35,969 INFO L93 Difference]: Finished difference Result 3793 states and 5903 transitions. [2019-10-15 01:08:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:08:35,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-15 01:08:35,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:08:35,988 INFO L225 Difference]: With dead ends: 3793 [2019-10-15 01:08:35,989 INFO L226 Difference]: Without dead ends: 2296 [2019-10-15 01:08:35,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:08:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-10-15 01:08:36,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1553. [2019-10-15 01:08:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-10-15 01:08:36,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2381 transitions. [2019-10-15 01:08:36,101 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2381 transitions. Word has length 164 [2019-10-15 01:08:36,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:08:36,102 INFO L462 AbstractCegarLoop]: Abstraction has 1553 states and 2381 transitions. [2019-10-15 01:08:36,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:08:36,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2381 transitions. [2019-10-15 01:08:36,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-15 01:08:36,106 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:08:36,107 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:36,316 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:36,317 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:08:36,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:08:36,318 INFO L82 PathProgramCache]: Analyzing trace with hash -418898119, now seen corresponding path program 1 times [2019-10-15 01:08:36,318 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:08:36,319 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017890776] [2019-10-15 01:08:36,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:36,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:08:36,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:08:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:36,517 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:08:36,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017890776] [2019-10-15 01:08:36,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450729048] [2019-10-15 01:08:36,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:08:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:08:37,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-15 01:08:37,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:08:37,158 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-15 01:08:37,158 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:08:37,560 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-15 01:08:37,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:08:37,561 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-15 01:08:37,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852081477] [2019-10-15 01:08:37,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:08:37,562 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:08:37,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:08:37,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-15 01:08:37,562 INFO L87 Difference]: Start difference. First operand 1553 states and 2381 transitions. Second operand 9 states.