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_spec2_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:29,526 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:29,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:29,541 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:29,541 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:29,542 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:29,544 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:29,545 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:29,547 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:29,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:29,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:29,550 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:29,550 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:29,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:29,552 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:29,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:29,554 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:29,555 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:29,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:29,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:29,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:29,561 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:29,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:29,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:29,565 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:29,566 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:29,566 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:29,567 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:29,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:29,569 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:29,569 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:29,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:29,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:29,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:29,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:29,578 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:29,579 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:29,579 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:29,579 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:29,580 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:29,581 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:29,581 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-13 21:10:29,604 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:29,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:29,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:29,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:29,607 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:29,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:29,608 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:29,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:29,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:29,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:29,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:29,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:29,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:29,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:29,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:29,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:29,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:29,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:29,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:29,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:29,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:29,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:29,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:29,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:29,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:29,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:29,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:29,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:29,613 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-13 21:10:29,890 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:29,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:29,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:29,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:29,909 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:29,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-10-13 21:10:29,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7927e3fc9/ab51cbd1935e48e2b57d8f262a0afe05/FLAG2c3740e9b [2019-10-13 21:10:30,601 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:30,602 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-10-13 21:10:30,645 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7927e3fc9/ab51cbd1935e48e2b57d8f262a0afe05/FLAG2c3740e9b [2019-10-13 21:10:30,811 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7927e3fc9/ab51cbd1935e48e2b57d8f262a0afe05 [2019-10-13 21:10:30,822 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:30,824 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:30,825 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:30,825 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:30,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:30,830 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:30" (1/1) ... [2019-10-13 21:10:30,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22c5b7dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:30, skipping insertion in model container [2019-10-13 21:10:30,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:30" (1/1) ... [2019-10-13 21:10:30,841 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:30,935 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:31,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:31,657 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:31,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:31,859 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:31,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31 WrapperNode [2019-10-13 21:10:31,859 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:31,860 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:31,860 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:31,861 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:31,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:31,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:31,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:31,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:31,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:32,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:32,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (1/1) ... [2019-10-13 21:10:32,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:32,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:32,078 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:32,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:32,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (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-13 21:10:32,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:32,170 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:32,170 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:32,171 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:32,171 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:32,171 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:32,172 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:32,172 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:32,172 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:32,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:32,173 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:32,174 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:32,176 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:32,176 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:32,176 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:32,177 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:32,177 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:32,177 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:32,177 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:32,177 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:32,178 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:32,178 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:32,178 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:32,178 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:32,178 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:32,179 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:32,179 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:32,179 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:32,179 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:32,179 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:32,180 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:32,180 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:32,180 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:32,180 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:10:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:32,181 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:32,182 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:32,182 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:32,182 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:32,183 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:32,183 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:32,183 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:32,183 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:32,184 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:32,184 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:32,184 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:32,184 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:32,184 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:32,184 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:32,185 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:32,186 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:32,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:32,188 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:32,189 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:32,190 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:32,191 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:32,192 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:32,193 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:32,194 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:32,195 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:32,196 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:32,198 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:32,199 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:32,200 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:32,201 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:10:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:32,202 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:32,203 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:32,204 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:32,205 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:32,208 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:32,209 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:32,210 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:32,210 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:32,218 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:32,219 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:32,220 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:32,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:32,221 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:32,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:34,871 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:34,872 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:34,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:34 BoogieIcfgContainer [2019-10-13 21:10:34,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:34,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:34,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:34,878 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:34,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:30" (1/3) ... [2019-10-13 21:10:34,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555d9c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:34, skipping insertion in model container [2019-10-13 21:10:34,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:31" (2/3) ... [2019-10-13 21:10:34,880 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@555d9c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:34, skipping insertion in model container [2019-10-13 21:10:34,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:34" (3/3) ... [2019-10-13 21:10:34,882 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2019-10-13 21:10:34,892 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:34,901 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:34,912 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:34,945 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:34,945 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:34,946 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:34,946 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:34,946 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:34,946 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:34,946 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:34,946 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:34,991 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states. [2019-10-13 21:10:35,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:10:35,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:35,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:35,019 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:35,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:35,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1835526368, now seen corresponding path program 1 times [2019-10-13 21:10:35,035 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:35,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879646634] [2019-10-13 21:10:35,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:35,036 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:35,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:35,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:35,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:35,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879646634] [2019-10-13 21:10:35,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:35,683 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:35,683 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247783091] [2019-10-13 21:10:35,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:35,690 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:35,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:35,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:35,707 INFO L87 Difference]: Start difference. First operand 742 states. Second operand 4 states. [2019-10-13 21:10:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:35,922 INFO L93 Difference]: Finished difference Result 1147 states and 1871 transitions. [2019-10-13 21:10:35,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:35,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 21:10:35,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:35,964 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:10:35,965 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:10:35,979 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-13 21:10:36,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:10:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:10:36,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:10:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 937 transitions. [2019-10-13 21:10:36,086 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 937 transitions. Word has length 107 [2019-10-13 21:10:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:36,086 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 937 transitions. [2019-10-13 21:10:36,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 937 transitions. [2019-10-13 21:10:36,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:10:36,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:36,099 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:36,099 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:36,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:36,099 INFO L82 PathProgramCache]: Analyzing trace with hash 443776321, now seen corresponding path program 1 times [2019-10-13 21:10:36,100 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:36,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571281027] [2019-10-13 21:10:36,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:36,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:36,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:36,278 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571281027] [2019-10-13 21:10:36,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:36,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:36,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10845987] [2019-10-13 21:10:36,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:36,293 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:36,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:36,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:36,294 INFO L87 Difference]: Start difference. First operand 582 states and 937 transitions. Second operand 4 states. [2019-10-13 21:10:36,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:36,373 INFO L93 Difference]: Finished difference Result 1127 states and 1832 transitions. [2019-10-13 21:10:36,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:36,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-13 21:10:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:36,382 INFO L225 Difference]: With dead ends: 1127 [2019-10-13 21:10:36,382 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:10:36,386 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-13 21:10:36,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:10:36,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:10:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:10:36,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 936 transitions. [2019-10-13 21:10:36,426 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 936 transitions. Word has length 110 [2019-10-13 21:10:36,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:36,426 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 936 transitions. [2019-10-13 21:10:36,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:36,427 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 936 transitions. [2019-10-13 21:10:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:10:36,438 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:36,439 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:36,439 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:36,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:36,439 INFO L82 PathProgramCache]: Analyzing trace with hash 15474447, now seen corresponding path program 1 times [2019-10-13 21:10:36,440 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:36,440 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194949504] [2019-10-13 21:10:36,440 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,441 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:36,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194949504] [2019-10-13 21:10:36,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:36,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:36,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465743862] [2019-10-13 21:10:36,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:36,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:36,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:36,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:36,634 INFO L87 Difference]: Start difference. First operand 582 states and 936 transitions. Second operand 4 states. [2019-10-13 21:10:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:36,734 INFO L93 Difference]: Finished difference Result 1127 states and 1831 transitions. [2019-10-13 21:10:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:36,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 21:10:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:36,740 INFO L225 Difference]: With dead ends: 1127 [2019-10-13 21:10:36,741 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:10:36,744 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-13 21:10:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:10:36,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:10:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:10:36,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 935 transitions. [2019-10-13 21:10:36,773 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 935 transitions. Word has length 111 [2019-10-13 21:10:36,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:36,773 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 935 transitions. [2019-10-13 21:10:36,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 935 transitions. [2019-10-13 21:10:36,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:10:36,778 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:36,778 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:36,779 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:36,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:36,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1301085565, now seen corresponding path program 1 times [2019-10-13 21:10:36,779 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:36,780 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129680428] [2019-10-13 21:10:36,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:36,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:36,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129680428] [2019-10-13 21:10:36,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:36,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:36,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752425857] [2019-10-13 21:10:36,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:36,903 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:36,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:36,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:36,904 INFO L87 Difference]: Start difference. First operand 582 states and 935 transitions. Second operand 4 states. [2019-10-13 21:10:36,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:36,976 INFO L93 Difference]: Finished difference Result 1127 states and 1830 transitions. [2019-10-13 21:10:36,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:36,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:10:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:36,983 INFO L225 Difference]: With dead ends: 1127 [2019-10-13 21:10:36,984 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:10:36,987 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-13 21:10:36,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:10:37,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:10:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:10:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 934 transitions. [2019-10-13 21:10:37,023 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 934 transitions. Word has length 112 [2019-10-13 21:10:37,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,024 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 934 transitions. [2019-10-13 21:10:37,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:37,024 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 934 transitions. [2019-10-13 21:10:37,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:10:37,028 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:37,028 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,029 INFO L82 PathProgramCache]: Analyzing trace with hash -116575413, now seen corresponding path program 1 times [2019-10-13 21:10:37,029 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,030 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675675253] [2019-10-13 21:10:37,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,030 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:37,151 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675675253] [2019-10-13 21:10:37,151 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:37,152 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:37,152 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325685748] [2019-10-13 21:10:37,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:37,153 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:37,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:37,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:37,154 INFO L87 Difference]: Start difference. First operand 582 states and 934 transitions. Second operand 4 states. [2019-10-13 21:10:37,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:37,206 INFO L93 Difference]: Finished difference Result 1127 states and 1829 transitions. [2019-10-13 21:10:37,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:37,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:10:37,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:37,211 INFO L225 Difference]: With dead ends: 1127 [2019-10-13 21:10:37,212 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:10:37,215 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-13 21:10:37,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:10:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:10:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:10:37,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 933 transitions. [2019-10-13 21:10:37,237 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 933 transitions. Word has length 113 [2019-10-13 21:10:37,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,238 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 933 transitions. [2019-10-13 21:10:37,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:37,238 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 933 transitions. [2019-10-13 21:10:37,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:10:37,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,242 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:37,242 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,243 INFO L82 PathProgramCache]: Analyzing trace with hash 563674553, now seen corresponding path program 1 times [2019-10-13 21:10:37,243 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,243 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912859633] [2019-10-13 21:10:37,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:37,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912859633] [2019-10-13 21:10:37,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:37,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:37,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716230616] [2019-10-13 21:10:37,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:37,473 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:37,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:37,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:37,476 INFO L87 Difference]: Start difference. First operand 582 states and 933 transitions. Second operand 10 states. [2019-10-13 21:10:37,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:37,709 INFO L93 Difference]: Finished difference Result 1085 states and 1749 transitions. [2019-10-13 21:10:37,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:37,709 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-13 21:10:37,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:37,715 INFO L225 Difference]: With dead ends: 1085 [2019-10-13 21:10:37,715 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:10:37,719 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-13 21:10:37,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:10:37,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-10-13 21:10:37,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:10:37,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-10-13 21:10:37,752 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-10-13 21:10:37,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,753 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-10-13 21:10:37,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:37,753 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-10-13 21:10:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:10:37,761 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,762 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:37,762 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash 983191384, now seen corresponding path program 1 times [2019-10-13 21:10:37,763 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,763 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288319491] [2019-10-13 21:10:37,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:37,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:37,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288319491] [2019-10-13 21:10:37,866 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:37,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:37,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460865792] [2019-10-13 21:10:37,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:37,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:37,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:37,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:37,868 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-10-13 21:10:37,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:37,925 INFO L93 Difference]: Finished difference Result 1133 states and 1835 transitions. [2019-10-13 21:10:37,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:37,926 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:10:37,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:37,931 INFO L225 Difference]: With dead ends: 1133 [2019-10-13 21:10:37,931 INFO L226 Difference]: Without dead ends: 576 [2019-10-13 21:10:37,934 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-13 21:10:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-13 21:10:37,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-13 21:10:37,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-13 21:10:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 919 transitions. [2019-10-13 21:10:37,957 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 919 transitions. Word has length 114 [2019-10-13 21:10:37,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:37,957 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 919 transitions. [2019-10-13 21:10:37,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:37,958 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 919 transitions. [2019-10-13 21:10:37,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:10:37,961 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:37,961 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:37,961 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:37,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:37,962 INFO L82 PathProgramCache]: Analyzing trace with hash 881745063, now seen corresponding path program 1 times [2019-10-13 21:10:37,962 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:37,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918947409] [2019-10-13 21:10:37,962 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,963 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:37,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:38,073 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918947409] [2019-10-13 21:10:38,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:38,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948610358] [2019-10-13 21:10:38,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:38,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:38,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:38,076 INFO L87 Difference]: Start difference. First operand 576 states and 919 transitions. Second operand 6 states. [2019-10-13 21:10:38,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:38,291 INFO L93 Difference]: Finished difference Result 1073 states and 1727 transitions. [2019-10-13 21:10:38,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:38,292 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-13 21:10:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:38,297 INFO L225 Difference]: With dead ends: 1073 [2019-10-13 21:10:38,297 INFO L226 Difference]: Without dead ends: 576 [2019-10-13 21:10:38,300 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-13 21:10:38,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-13 21:10:38,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-13 21:10:38,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-13 21:10:38,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 915 transitions. [2019-10-13 21:10:38,376 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 915 transitions. Word has length 115 [2019-10-13 21:10:38,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:38,376 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 915 transitions. [2019-10-13 21:10:38,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:38,377 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 915 transitions. [2019-10-13 21:10:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:10:38,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:38,380 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:38,381 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:38,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash -2138395236, now seen corresponding path program 1 times [2019-10-13 21:10:38,381 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:38,382 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690312538] [2019-10-13 21:10:38,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,382 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:38,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690312538] [2019-10-13 21:10:38,495 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,495 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:38,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158045088] [2019-10-13 21:10:38,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:38,496 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:38,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:38,497 INFO L87 Difference]: Start difference. First operand 576 states and 915 transitions. Second operand 6 states. [2019-10-13 21:10:38,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:38,710 INFO L93 Difference]: Finished difference Result 1073 states and 1723 transitions. [2019-10-13 21:10:38,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:38,711 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-13 21:10:38,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:38,716 INFO L225 Difference]: With dead ends: 1073 [2019-10-13 21:10:38,716 INFO L226 Difference]: Without dead ends: 576 [2019-10-13 21:10:38,719 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-13 21:10:38,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-13 21:10:38,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-13 21:10:38,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-13 21:10:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 911 transitions. [2019-10-13 21:10:38,750 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 911 transitions. Word has length 116 [2019-10-13 21:10:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:38,751 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 911 transitions. [2019-10-13 21:10:38,751 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:38,751 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 911 transitions. [2019-10-13 21:10:38,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:10:38,755 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:38,755 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:38,755 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:38,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:38,755 INFO L82 PathProgramCache]: Analyzing trace with hash 603126668, now seen corresponding path program 1 times [2019-10-13 21:10:38,756 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:38,756 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817006127] [2019-10-13 21:10:38,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,756 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:38,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:38,906 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817006127] [2019-10-13 21:10:38,907 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:38,907 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:38,908 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656719041] [2019-10-13 21:10:38,909 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:38,909 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:38,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:38,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:38,910 INFO L87 Difference]: Start difference. First operand 576 states and 911 transitions. Second operand 6 states. [2019-10-13 21:10:39,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,127 INFO L93 Difference]: Finished difference Result 1073 states and 1719 transitions. [2019-10-13 21:10:39,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:39,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-13 21:10:39,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,133 INFO L225 Difference]: With dead ends: 1073 [2019-10-13 21:10:39,133 INFO L226 Difference]: Without dead ends: 576 [2019-10-13 21:10:39,136 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-13 21:10:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-13 21:10:39,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-13 21:10:39,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-13 21:10:39,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 907 transitions. [2019-10-13 21:10:39,158 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 907 transitions. Word has length 117 [2019-10-13 21:10:39,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,158 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 907 transitions. [2019-10-13 21:10:39,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:39,158 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 907 transitions. [2019-10-13 21:10:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:10:39,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:39,162 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1057986572, now seen corresponding path program 1 times [2019-10-13 21:10:39,163 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510655646] [2019-10-13 21:10:39,163 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:39,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510655646] [2019-10-13 21:10:39,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:39,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476869054] [2019-10-13 21:10:39,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:39,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:39,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:39,291 INFO L87 Difference]: Start difference. First operand 576 states and 907 transitions. Second operand 7 states. [2019-10-13 21:10:39,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,387 INFO L93 Difference]: Finished difference Result 1073 states and 1715 transitions. [2019-10-13 21:10:39,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:39,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-13 21:10:39,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,393 INFO L225 Difference]: With dead ends: 1073 [2019-10-13 21:10:39,394 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:10:39,434 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-13 21:10:39,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:10:39,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:10:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:10:39,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 873 transitions. [2019-10-13 21:10:39,453 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 873 transitions. Word has length 117 [2019-10-13 21:10:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,454 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 873 transitions. [2019-10-13 21:10:39,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 873 transitions. [2019-10-13 21:10:39,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:10:39,458 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,458 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:39,458 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1567550433, now seen corresponding path program 1 times [2019-10-13 21:10:39,459 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,459 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035713469] [2019-10-13 21:10:39,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,459 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:39,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035713469] [2019-10-13 21:10:39,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:39,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377435886] [2019-10-13 21:10:39,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:39,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:39,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:39,591 INFO L87 Difference]: Start difference. First operand 555 states and 873 transitions. Second operand 6 states. [2019-10-13 21:10:39,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:39,728 INFO L93 Difference]: Finished difference Result 1052 states and 1681 transitions. [2019-10-13 21:10:39,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:39,729 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-13 21:10:39,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:39,735 INFO L225 Difference]: With dead ends: 1052 [2019-10-13 21:10:39,735 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:10:39,740 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-13 21:10:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:10:39,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:10:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:10:39,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 872 transitions. [2019-10-13 21:10:39,763 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 872 transitions. Word has length 118 [2019-10-13 21:10:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:39,765 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 872 transitions. [2019-10-13 21:10:39,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:39,766 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 872 transitions. [2019-10-13 21:10:39,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:10:39,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:39,771 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:39,772 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:39,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:39,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1018460559, now seen corresponding path program 1 times [2019-10-13 21:10:39,773 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:39,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705668101] [2019-10-13 21:10:39,773 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:39,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:39,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:39,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705668101] [2019-10-13 21:10:39,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:39,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:39,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343785875] [2019-10-13 21:10:39,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:39,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:39,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:39,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:39,958 INFO L87 Difference]: Start difference. First operand 555 states and 872 transitions. Second operand 6 states. [2019-10-13 21:10:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,086 INFO L93 Difference]: Finished difference Result 1052 states and 1680 transitions. [2019-10-13 21:10:40,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:40,087 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-13 21:10:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,092 INFO L225 Difference]: With dead ends: 1052 [2019-10-13 21:10:40,092 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:10:40,096 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-13 21:10:40,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:10:40,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:10:40,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:10:40,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 871 transitions. [2019-10-13 21:10:40,132 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 871 transitions. Word has length 119 [2019-10-13 21:10:40,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,135 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 871 transitions. [2019-10-13 21:10:40,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:40,135 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 871 transitions. [2019-10-13 21:10:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:10:40,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,141 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:40,142 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1998799322, now seen corresponding path program 1 times [2019-10-13 21:10:40,143 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749630394] [2019-10-13 21:10:40,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:40,342 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749630394] [2019-10-13 21:10:40,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:40,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404041484] [2019-10-13 21:10:40,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:40,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:40,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:40,345 INFO L87 Difference]: Start difference. First operand 555 states and 871 transitions. Second operand 12 states. [2019-10-13 21:10:40,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:40,557 INFO L93 Difference]: Finished difference Result 1053 states and 1679 transitions. [2019-10-13 21:10:40,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:40,558 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-13 21:10:40,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:40,562 INFO L225 Difference]: With dead ends: 1053 [2019-10-13 21:10:40,562 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:10:40,565 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:40,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:10:40,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:10:40,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:10:40,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 870 transitions. [2019-10-13 21:10:40,583 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 870 transitions. Word has length 120 [2019-10-13 21:10:40,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:40,584 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 870 transitions. [2019-10-13 21:10:40,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:40,584 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 870 transitions. [2019-10-13 21:10:40,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:10:40,588 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:40,588 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:40,588 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:40,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:40,588 INFO L82 PathProgramCache]: Analyzing trace with hash 504527096, now seen corresponding path program 1 times [2019-10-13 21:10:40,589 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:40,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586407465] [2019-10-13 21:10:40,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,589 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:40,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:40,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:40,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586407465] [2019-10-13 21:10:40,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:40,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:10:40,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533608732] [2019-10-13 21:10:40,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:40,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:40,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:40,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:10:40,752 INFO L87 Difference]: Start difference. First operand 555 states and 870 transitions. Second operand 9 states. [2019-10-13 21:10:44,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:44,857 INFO L93 Difference]: Finished difference Result 1050 states and 1693 transitions. [2019-10-13 21:10:44,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:10:44,858 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-13 21:10:44,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:44,862 INFO L225 Difference]: With dead ends: 1050 [2019-10-13 21:10:44,862 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:10:44,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:10:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:10:44,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-13 21:10:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-13 21:10:44,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 889 transitions. [2019-10-13 21:10:44,890 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 889 transitions. Word has length 121 [2019-10-13 21:10:44,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:44,890 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 889 transitions. [2019-10-13 21:10:44,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:44,890 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 889 transitions. [2019-10-13 21:10:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:10:44,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:44,894 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:44,894 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:44,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:44,895 INFO L82 PathProgramCache]: Analyzing trace with hash -250381492, now seen corresponding path program 1 times [2019-10-13 21:10:44,895 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:44,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638523101] [2019-10-13 21:10:44,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:44,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:44,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:44,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:45,066 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638523101] [2019-10-13 21:10:45,066 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:45,066 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:10:45,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001131055] [2019-10-13 21:10:45,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:10:45,067 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:45,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:10:45,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:45,068 INFO L87 Difference]: Start difference. First operand 559 states and 889 transitions. Second operand 8 states. [2019-10-13 21:10:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:50,805 INFO L93 Difference]: Finished difference Result 1962 states and 3248 transitions. [2019-10-13 21:10:50,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:10:50,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-13 21:10:50,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:50,820 INFO L225 Difference]: With dead ends: 1962 [2019-10-13 21:10:50,820 INFO L226 Difference]: Without dead ends: 1469 [2019-10-13 21:10:50,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:10:50,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-10-13 21:10:50,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1430. [2019-10-13 21:10:50,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-10-13 21:10:50,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2296 transitions. [2019-10-13 21:10:50,893 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2296 transitions. Word has length 122 [2019-10-13 21:10:50,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:50,894 INFO L462 AbstractCegarLoop]: Abstraction has 1430 states and 2296 transitions. [2019-10-13 21:10:50,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:10:50,894 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2296 transitions. [2019-10-13 21:10:50,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:10:50,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:50,897 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:50,898 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:50,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1214123081, now seen corresponding path program 1 times [2019-10-13 21:10:50,898 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:50,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362883178] [2019-10-13 21:10:50,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:50,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:50,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:51,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:51,042 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362883178] [2019-10-13 21:10:51,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:51,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:10:51,043 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846069454] [2019-10-13 21:10:51,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:51,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:51,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:51,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:10:51,044 INFO L87 Difference]: Start difference. First operand 1430 states and 2296 transitions. Second operand 9 states. [2019-10-13 21:10:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:57,948 INFO L93 Difference]: Finished difference Result 4504 states and 7422 transitions. [2019-10-13 21:10:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:10:57,949 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-13 21:10:57,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:57,977 INFO L225 Difference]: With dead ends: 4504 [2019-10-13 21:10:57,977 INFO L226 Difference]: Without dead ends: 3140 [2019-10-13 21:10:57,985 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:10:57,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2019-10-13 21:10:58,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 2917. [2019-10-13 21:10:58,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2019-10-13 21:10:58,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4711 transitions. [2019-10-13 21:10:58,129 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4711 transitions. Word has length 128 [2019-10-13 21:10:58,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:58,129 INFO L462 AbstractCegarLoop]: Abstraction has 2917 states and 4711 transitions. [2019-10-13 21:10:58,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4711 transitions. [2019-10-13 21:10:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:10:58,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:58,133 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:10:58,133 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:58,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1206363722, now seen corresponding path program 1 times [2019-10-13 21:10:58,134 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:58,134 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825988526] [2019-10-13 21:10:58,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:58,134 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:58,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:10:58,267 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825988526] [2019-10-13 21:10:58,268 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:58,268 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:10:58,268 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947385256] [2019-10-13 21:10:58,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:58,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:58,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:58,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:58,269 INFO L87 Difference]: Start difference. First operand 2917 states and 4711 transitions. Second operand 5 states. [2019-10-13 21:11:00,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:11:00,673 INFO L93 Difference]: Finished difference Result 6396 states and 10301 transitions. [2019-10-13 21:11:00,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:11:00,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-13 21:11:00,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:11:00,705 INFO L225 Difference]: With dead ends: 6396 [2019-10-13 21:11:00,705 INFO L226 Difference]: Without dead ends: 4288 [2019-10-13 21:11:00,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:00,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-10-13 21:11:00,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4261. [2019-10-13 21:11:00,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2019-10-13 21:11:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6797 transitions. [2019-10-13 21:11:00,937 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6797 transitions. Word has length 128 [2019-10-13 21:11:00,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:11:00,938 INFO L462 AbstractCegarLoop]: Abstraction has 4261 states and 6797 transitions. [2019-10-13 21:11:00,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:11:00,938 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6797 transitions. [2019-10-13 21:11:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:11:00,941 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:11:00,941 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:11:00,942 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:11:00,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:11:00,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1039215732, now seen corresponding path program 1 times [2019-10-13 21:11:00,943 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:11:00,943 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322782626] [2019-10-13 21:11:00,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,943 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:11:00,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:11:00,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:11:01,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 21:11:01,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322782626] [2019-10-13 21:11:01,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:11:01,085 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:11:01,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398090147] [2019-10-13 21:11:01,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:11:01,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:11:01,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:11:01,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:11:01,086 INFO L87 Difference]: Start difference. First operand 4261 states and 6797 transitions. Second operand 7 states.