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_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:22,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:22,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:22,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:22,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:22,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:22,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:22,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:22,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:22,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:22,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:22,051 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:22,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:22,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:22,055 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:22,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:22,058 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:22,059 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:22,061 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:22,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:22,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:22,072 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:22,073 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:22,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:22,075 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:22,076 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:22,076 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:22,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:22,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:22,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:22,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:22,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:22,079 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:22,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:22,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:22,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:22,081 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:22,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:22,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:22,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:22,083 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:22,084 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:22,097 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:22,098 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:22,099 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:22,099 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:22,099 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:22,099 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:22,099 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:22,100 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:22,100 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:22,100 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:22,100 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:22,100 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:22,101 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:22,101 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:22,101 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:22,101 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:22,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:22,102 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:22,102 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:22,102 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:22,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:22,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:22,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:22,103 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:22,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:22,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:22,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:22,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:22,104 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:22,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:22,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:22,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:22,397 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:22,397 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:22,398 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-10-13 21:10:22,470 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaaa2ed1a/e2793e50143a405bbdc6aaff168467e2/FLAG07a971923 [2019-10-13 21:10:23,105 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:23,108 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product09.cil.c [2019-10-13 21:10:23,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaaa2ed1a/e2793e50143a405bbdc6aaff168467e2/FLAG07a971923 [2019-10-13 21:10:23,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaaa2ed1a/e2793e50143a405bbdc6aaff168467e2 [2019-10-13 21:10:23,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:23,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:23,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:23,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:23,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:23,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,363 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d2ce11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23, skipping insertion in model container [2019-10-13 21:10:23,363 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:23" (1/1) ... [2019-10-13 21:10:23,370 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:23,456 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:24,078 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:24,099 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:24,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:24,307 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:24,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:24 WrapperNode [2019-10-13 21:10:24,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:24,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:24,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:24,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:24,326 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:24" (1/1) ... [2019-10-13 21:10:24,327 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:24" (1/1) ... [2019-10-13 21:10:24,398 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:24" (1/1) ... [2019-10-13 21:10:24,401 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:24" (1/1) ... [2019-10-13 21:10:24,462 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:24" (1/1) ... [2019-10-13 21:10:24,510 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:24" (1/1) ... [2019-10-13 21:10:24,525 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:24" (1/1) ... [2019-10-13 21:10:24,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:24,549 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:24,550 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:24,550 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:24,551 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:24" (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:24,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:24,621 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:24,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:24,622 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:24,622 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:24,623 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:24,623 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:24,624 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:24,624 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:24,625 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:24,626 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:24,626 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:24,627 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:24,629 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:24,630 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:24,631 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:24,631 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:24,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:24,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:24,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:24,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:24,632 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:24,632 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:24,632 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:24,632 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:24,633 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:24,633 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:24,633 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:24,633 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:24,634 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:24,634 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:24,634 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:24,634 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:24,634 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:10:24,635 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:24,636 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:24,637 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:24,637 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:24,637 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:24,637 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:24,637 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:24,637 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:24,638 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:24,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:24,640 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:24,641 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:24,642 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:24,643 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:24,644 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:24,645 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:24,646 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:24,647 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:24,648 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:24,649 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:24,650 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:24,651 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:24,652 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:24,653 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:24,654 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:10:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:24,655 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:24,656 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:24,657 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:24,660 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:24,661 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:24,662 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:24,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:24,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:24,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:24,671 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:24,672 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:26,765 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:26,766 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:26,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:26 BoogieIcfgContainer [2019-10-13 21:10:26,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:26,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:26,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:26,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:26,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:23" (1/3) ... [2019-10-13 21:10:26,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61abbf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:26, skipping insertion in model container [2019-10-13 21:10:26,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:24" (2/3) ... [2019-10-13 21:10:26,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61abbf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:26, skipping insertion in model container [2019-10-13 21:10:26,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:26" (3/3) ... [2019-10-13 21:10:26,777 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product09.cil.c [2019-10-13 21:10:26,789 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:26,800 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:26,811 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:26,854 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:26,855 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:26,855 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:26,855 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:26,855 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:26,855 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:26,855 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:26,855 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:26,898 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states. [2019-10-13 21:10:26,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:10:26,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:26,930 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:26,934 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:26,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:26,940 INFO L82 PathProgramCache]: Analyzing trace with hash -943810912, now seen corresponding path program 1 times [2019-10-13 21:10:26,949 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:26,949 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143287011] [2019-10-13 21:10:26,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:26,950 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:26,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:27,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:27,568 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:27,569 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143287011] [2019-10-13 21:10:27,570 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:27,570 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:27,570 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320874654] [2019-10-13 21:10:27,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:27,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:27,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:27,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:27,593 INFO L87 Difference]: Start difference. First operand 737 states. Second operand 4 states. [2019-10-13 21:10:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:27,765 INFO L93 Difference]: Finished difference Result 1137 states and 1861 transitions. [2019-10-13 21:10:27,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:27,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 21:10:27,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:27,801 INFO L225 Difference]: With dead ends: 1137 [2019-10-13 21:10:27,801 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:10:27,813 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:27,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:10:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-13 21:10:27,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:10:27,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 932 transitions. [2019-10-13 21:10:27,950 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 932 transitions. Word has length 107 [2019-10-13 21:10:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:27,951 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 932 transitions. [2019-10-13 21:10:27,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 932 transitions. [2019-10-13 21:10:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:10:27,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:27,959 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:27,959 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:27,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1793356700, now seen corresponding path program 1 times [2019-10-13 21:10:27,960 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:27,960 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035161897] [2019-10-13 21:10:27,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,180 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:28,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035161897] [2019-10-13 21:10:28,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:28,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309989401] [2019-10-13 21:10:28,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:28,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:28,186 INFO L87 Difference]: Start difference. First operand 577 states and 932 transitions. Second operand 4 states. [2019-10-13 21:10:28,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,254 INFO L93 Difference]: Finished difference Result 1117 states and 1822 transitions. [2019-10-13 21:10:28,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:28,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-13 21:10:28,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,259 INFO L225 Difference]: With dead ends: 1117 [2019-10-13 21:10:28,260 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:10:28,264 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:28,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:10:28,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-13 21:10:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:10:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 931 transitions. [2019-10-13 21:10:28,316 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 931 transitions. Word has length 110 [2019-10-13 21:10:28,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,318 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 931 transitions. [2019-10-13 21:10:28,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:28,320 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 931 transitions. [2019-10-13 21:10:28,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:10:28,337 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,337 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:28,337 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1568343631, now seen corresponding path program 1 times [2019-10-13 21:10:28,338 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,338 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092008083] [2019-10-13 21:10:28,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,338 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,573 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:28,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092008083] [2019-10-13 21:10:28,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:28,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42884296] [2019-10-13 21:10:28,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:28,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:28,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:28,576 INFO L87 Difference]: Start difference. First operand 577 states and 931 transitions. Second operand 4 states. [2019-10-13 21:10:28,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,640 INFO L93 Difference]: Finished difference Result 1117 states and 1821 transitions. [2019-10-13 21:10:28,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:28,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 21:10:28,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,646 INFO L225 Difference]: With dead ends: 1117 [2019-10-13 21:10:28,646 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:10:28,649 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:28,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:10:28,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-13 21:10:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:10:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 930 transitions. [2019-10-13 21:10:28,672 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 930 transitions. Word has length 111 [2019-10-13 21:10:28,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,673 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 930 transitions. [2019-10-13 21:10:28,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 930 transitions. [2019-10-13 21:10:28,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:10:28,676 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,677 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:28,677 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,677 INFO L82 PathProgramCache]: Analyzing trace with hash 84938816, now seen corresponding path program 1 times [2019-10-13 21:10:28,678 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036769872] [2019-10-13 21:10:28,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,678 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,805 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:28,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036769872] [2019-10-13 21:10:28,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:28,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895402723] [2019-10-13 21:10:28,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:28,807 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:28,808 INFO L87 Difference]: Start difference. First operand 577 states and 930 transitions. Second operand 4 states. [2019-10-13 21:10:28,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,881 INFO L93 Difference]: Finished difference Result 1117 states and 1820 transitions. [2019-10-13 21:10:28,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:28,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:10:28,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,889 INFO L225 Difference]: With dead ends: 1117 [2019-10-13 21:10:28,889 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:10:28,893 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:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:10:28,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-13 21:10:28,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:10:28,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 929 transitions. [2019-10-13 21:10:28,916 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 929 transitions. Word has length 112 [2019-10-13 21:10:28,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,916 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 929 transitions. [2019-10-13 21:10:28,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 929 transitions. [2019-10-13 21:10:28,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:10:28,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,920 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:28,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1272870165, now seen corresponding path program 1 times [2019-10-13 21:10:28,921 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011062753] [2019-10-13 21:10:28,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,057 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:29,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011062753] [2019-10-13 21:10:29,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:29,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749002475] [2019-10-13 21:10:29,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:29,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:29,060 INFO L87 Difference]: Start difference. First operand 577 states and 929 transitions. Second operand 4 states. [2019-10-13 21:10:29,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,128 INFO L93 Difference]: Finished difference Result 1117 states and 1819 transitions. [2019-10-13 21:10:29,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:29,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:10:29,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,140 INFO L225 Difference]: With dead ends: 1117 [2019-10-13 21:10:29,140 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:10:29,146 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:29,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:10:29,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 577. [2019-10-13 21:10:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 577 states. [2019-10-13 21:10:29,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 577 states to 577 states and 928 transitions. [2019-10-13 21:10:29,177 INFO L78 Accepts]: Start accepts. Automaton has 577 states and 928 transitions. Word has length 113 [2019-10-13 21:10:29,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,177 INFO L462 AbstractCegarLoop]: Abstraction has 577 states and 928 transitions. [2019-10-13 21:10:29,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:29,178 INFO L276 IsEmpty]: Start isEmpty. Operand 577 states and 928 transitions. [2019-10-13 21:10:29,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:10:29,185 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,185 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:29,185 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1262791708, now seen corresponding path program 1 times [2019-10-13 21:10:29,186 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657122547] [2019-10-13 21:10:29,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,187 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,461 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:29,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657122547] [2019-10-13 21:10:29,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,463 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:29,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926285415] [2019-10-13 21:10:29,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:29,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:29,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:29,470 INFO L87 Difference]: Start difference. First operand 577 states and 928 transitions. Second operand 10 states. [2019-10-13 21:10:29,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,624 INFO L93 Difference]: Finished difference Result 1075 states and 1739 transitions. [2019-10-13 21:10:29,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:29,625 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-13 21:10:29,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,630 INFO L225 Difference]: With dead ends: 1075 [2019-10-13 21:10:29,630 INFO L226 Difference]: Without dead ends: 586 [2019-10-13 21:10:29,633 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:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-13 21:10:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2019-10-13 21:10:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2019-10-13 21:10:29,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 937 transitions. [2019-10-13 21:10:29,662 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 937 transitions. Word has length 114 [2019-10-13 21:10:29,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,663 INFO L462 AbstractCegarLoop]: Abstraction has 584 states and 937 transitions. [2019-10-13 21:10:29,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:29,663 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 937 transitions. [2019-10-13 21:10:29,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:10:29,669 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,669 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:29,670 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1682308539, now seen corresponding path program 1 times [2019-10-13 21:10:29,670 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,670 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519852634] [2019-10-13 21:10:29,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,671 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,766 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:29,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519852634] [2019-10-13 21:10:29,767 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,767 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:29,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174457495] [2019-10-13 21:10:29,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:29,768 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:29,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:29,769 INFO L87 Difference]: Start difference. First operand 584 states and 937 transitions. Second operand 4 states. [2019-10-13 21:10:29,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,814 INFO L93 Difference]: Finished difference Result 1123 states and 1825 transitions. [2019-10-13 21:10:29,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:29,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:10:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,819 INFO L225 Difference]: With dead ends: 1123 [2019-10-13 21:10:29,819 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:10:29,822 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:29,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:10:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:10:29,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:10:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 914 transitions. [2019-10-13 21:10:29,842 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 914 transitions. Word has length 114 [2019-10-13 21:10:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,842 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 914 transitions. [2019-10-13 21:10:29,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 914 transitions. [2019-10-13 21:10:29,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:10:29,845 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,846 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:29,846 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,846 INFO L82 PathProgramCache]: Analyzing trace with hash 441821781, now seen corresponding path program 1 times [2019-10-13 21:10:29,847 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294897820] [2019-10-13 21:10:29,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,847 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,032 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:30,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294897820] [2019-10-13 21:10:30,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:30,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527637104] [2019-10-13 21:10:30,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:30,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:30,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:30,035 INFO L87 Difference]: Start difference. First operand 571 states and 914 transitions. Second operand 6 states. [2019-10-13 21:10:30,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,240 INFO L93 Difference]: Finished difference Result 1063 states and 1717 transitions. [2019-10-13 21:10:30,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:30,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-13 21:10:30,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,247 INFO L225 Difference]: With dead ends: 1063 [2019-10-13 21:10:30,247 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:10:30,250 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:30,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:10:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:10:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:10:30,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 910 transitions. [2019-10-13 21:10:30,273 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 910 transitions. Word has length 115 [2019-10-13 21:10:30,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,275 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 910 transitions. [2019-10-13 21:10:30,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:30,275 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 910 transitions. [2019-10-13 21:10:30,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:10:30,279 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,279 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:30,279 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,279 INFO L82 PathProgramCache]: Analyzing trace with hash 766133599, now seen corresponding path program 1 times [2019-10-13 21:10:30,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593671937] [2019-10-13 21:10:30,283 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,284 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,431 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:30,431 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593671937] [2019-10-13 21:10:30,432 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:30,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128719716] [2019-10-13 21:10:30,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:30,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:30,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:30,434 INFO L87 Difference]: Start difference. First operand 571 states and 910 transitions. Second operand 6 states. [2019-10-13 21:10:30,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,644 INFO L93 Difference]: Finished difference Result 1063 states and 1713 transitions. [2019-10-13 21:10:30,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:30,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-13 21:10:30,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,650 INFO L225 Difference]: With dead ends: 1063 [2019-10-13 21:10:30,650 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:10:30,653 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:30,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:10:30,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:10:30,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:10:30,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 906 transitions. [2019-10-13 21:10:30,677 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 906 transitions. Word has length 116 [2019-10-13 21:10:30,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,678 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 906 transitions. [2019-10-13 21:10:30,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:30,679 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 906 transitions. [2019-10-13 21:10:30,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:10:30,682 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,682 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:30,682 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash -188511270, now seen corresponding path program 1 times [2019-10-13 21:10:30,683 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,683 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360961971] [2019-10-13 21:10:30,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,683 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,811 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:30,811 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360961971] [2019-10-13 21:10:30,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:30,813 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410950776] [2019-10-13 21:10:30,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:30,814 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:30,814 INFO L87 Difference]: Start difference. First operand 571 states and 906 transitions. Second operand 6 states. [2019-10-13 21:10:31,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,031 INFO L93 Difference]: Finished difference Result 1063 states and 1709 transitions. [2019-10-13 21:10:31,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:31,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-13 21:10:31,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,036 INFO L225 Difference]: With dead ends: 1063 [2019-10-13 21:10:31,036 INFO L226 Difference]: Without dead ends: 571 [2019-10-13 21:10:31,039 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:31,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-10-13 21:10:31,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2019-10-13 21:10:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2019-10-13 21:10:31,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 902 transitions. [2019-10-13 21:10:31,057 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 902 transitions. Word has length 117 [2019-10-13 21:10:31,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,058 INFO L462 AbstractCegarLoop]: Abstraction has 571 states and 902 transitions. [2019-10-13 21:10:31,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:31,058 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 902 transitions. [2019-10-13 21:10:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:10:31,061 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,062 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:31,062 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,062 INFO L82 PathProgramCache]: Analyzing trace with hash 266348634, now seen corresponding path program 1 times [2019-10-13 21:10:31,062 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,063 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518570967] [2019-10-13 21:10:31,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,063 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,179 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:31,180 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518570967] [2019-10-13 21:10:31,180 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,180 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:31,180 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956518477] [2019-10-13 21:10:31,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:31,181 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:31,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:31,182 INFO L87 Difference]: Start difference. First operand 571 states and 902 transitions. Second operand 7 states. [2019-10-13 21:10:31,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,265 INFO L93 Difference]: Finished difference Result 1063 states and 1705 transitions. [2019-10-13 21:10:31,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:31,265 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-13 21:10:31,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,270 INFO L225 Difference]: With dead ends: 1063 [2019-10-13 21:10:31,270 INFO L226 Difference]: Without dead ends: 550 [2019-10-13 21:10:31,273 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:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-13 21:10:31,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-13 21:10:31,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-13 21:10:31,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 868 transitions. [2019-10-13 21:10:31,294 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 868 transitions. Word has length 117 [2019-10-13 21:10:31,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,294 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 868 transitions. [2019-10-13 21:10:31,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:31,294 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 868 transitions. [2019-10-13 21:10:31,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:10:31,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,298 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:31,298 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2136107772, now seen corresponding path program 1 times [2019-10-13 21:10:31,299 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,299 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528718638] [2019-10-13 21:10:31,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,407 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:31,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528718638] [2019-10-13 21:10:31,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:31,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468897098] [2019-10-13 21:10:31,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:31,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:31,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:31,410 INFO L87 Difference]: Start difference. First operand 550 states and 868 transitions. Second operand 6 states. [2019-10-13 21:10:31,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,498 INFO L93 Difference]: Finished difference Result 1042 states and 1671 transitions. [2019-10-13 21:10:31,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:31,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-13 21:10:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,504 INFO L225 Difference]: With dead ends: 1042 [2019-10-13 21:10:31,504 INFO L226 Difference]: Without dead ends: 550 [2019-10-13 21:10:31,507 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:31,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-13 21:10:31,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-13 21:10:31,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-13 21:10:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 867 transitions. [2019-10-13 21:10:31,527 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 867 transitions. Word has length 118 [2019-10-13 21:10:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,528 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 867 transitions. [2019-10-13 21:10:31,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:31,528 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 867 transitions. [2019-10-13 21:10:31,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:10:31,531 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,532 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:31,532 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,532 INFO L82 PathProgramCache]: Analyzing trace with hash -505466529, now seen corresponding path program 1 times [2019-10-13 21:10:31,533 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,533 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737854948] [2019-10-13 21:10:31,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,533 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,684 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:31,684 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737854948] [2019-10-13 21:10:31,684 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:31,685 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474712521] [2019-10-13 21:10:31,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:31,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:31,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:31,686 INFO L87 Difference]: Start difference. First operand 550 states and 867 transitions. Second operand 6 states. [2019-10-13 21:10:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,769 INFO L93 Difference]: Finished difference Result 1042 states and 1670 transitions. [2019-10-13 21:10:31,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:31,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-13 21:10:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,774 INFO L225 Difference]: With dead ends: 1042 [2019-10-13 21:10:31,774 INFO L226 Difference]: Without dead ends: 550 [2019-10-13 21:10:31,777 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:31,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-13 21:10:31,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-13 21:10:31,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-13 21:10:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 866 transitions. [2019-10-13 21:10:31,794 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 866 transitions. Word has length 119 [2019-10-13 21:10:31,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,795 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 866 transitions. [2019-10-13 21:10:31,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 866 transitions. [2019-10-13 21:10:31,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:10:31,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,799 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:31,799 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,800 INFO L82 PathProgramCache]: Analyzing trace with hash -585955541, now seen corresponding path program 1 times [2019-10-13 21:10:31,800 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996616859] [2019-10-13 21:10:31,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,896 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:31,897 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996616859] [2019-10-13 21:10:31,897 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,897 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:31,897 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489111479] [2019-10-13 21:10:31,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:31,898 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:31,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:31,899 INFO L87 Difference]: Start difference. First operand 550 states and 866 transitions. Second operand 4 states. [2019-10-13 21:10:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,942 INFO L93 Difference]: Finished difference Result 1042 states and 1669 transitions. [2019-10-13 21:10:31,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:31,942 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-13 21:10:31,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,946 INFO L225 Difference]: With dead ends: 1042 [2019-10-13 21:10:31,946 INFO L226 Difference]: Without dead ends: 550 [2019-10-13 21:10:31,949 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:31,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-13 21:10:31,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-13 21:10:31,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-13 21:10:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 865 transitions. [2019-10-13 21:10:31,966 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 865 transitions. Word has length 120 [2019-10-13 21:10:31,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,967 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 865 transitions. [2019-10-13 21:10:31,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:31,967 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 865 transitions. [2019-10-13 21:10:31,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:10:31,970 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,970 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:31,970 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,971 INFO L82 PathProgramCache]: Analyzing trace with hash 381395113, now seen corresponding path program 1 times [2019-10-13 21:10:31,971 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858166880] [2019-10-13 21:10:31,971 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,972 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:32,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:32,130 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:32,130 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858166880] [2019-10-13 21:10:32,130 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:32,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:32,131 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854712862] [2019-10-13 21:10:32,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:32,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:32,132 INFO L87 Difference]: Start difference. First operand 550 states and 865 transitions. Second operand 12 states. [2019-10-13 21:10:32,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:32,287 INFO L93 Difference]: Finished difference Result 1043 states and 1668 transitions. [2019-10-13 21:10:32,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:32,288 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-13 21:10:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:32,292 INFO L225 Difference]: With dead ends: 1043 [2019-10-13 21:10:32,292 INFO L226 Difference]: Without dead ends: 550 [2019-10-13 21:10:32,295 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:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2019-10-13 21:10:32,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2019-10-13 21:10:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-10-13 21:10:32,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 864 transitions. [2019-10-13 21:10:32,313 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 864 transitions. Word has length 120 [2019-10-13 21:10:32,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:32,313 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 864 transitions. [2019-10-13 21:10:32,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:32,313 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 864 transitions. [2019-10-13 21:10:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:10:32,316 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:32,316 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:32,317 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:32,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:32,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1579499078, now seen corresponding path program 1 times [2019-10-13 21:10:32,317 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:32,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857584049] [2019-10-13 21:10:32,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,318 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:32,483 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:32,484 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857584049] [2019-10-13 21:10:32,484 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:32,484 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:10:32,484 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828135968] [2019-10-13 21:10:32,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:32,485 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:32,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:32,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:10:32,486 INFO L87 Difference]: Start difference. First operand 550 states and 864 transitions. Second operand 9 states. [2019-10-13 21:10:36,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:36,081 INFO L93 Difference]: Finished difference Result 1040 states and 1682 transitions. [2019-10-13 21:10:36,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:10:36,082 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-13 21:10:36,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:36,086 INFO L225 Difference]: With dead ends: 1040 [2019-10-13 21:10:36,086 INFO L226 Difference]: Without dead ends: 556 [2019-10-13 21:10:36,089 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:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2019-10-13 21:10:36,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 554. [2019-10-13 21:10:36,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2019-10-13 21:10:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 883 transitions. [2019-10-13 21:10:36,112 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 883 transitions. Word has length 121 [2019-10-13 21:10:36,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:36,112 INFO L462 AbstractCegarLoop]: Abstraction has 554 states and 883 transitions. [2019-10-13 21:10:36,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 883 transitions. [2019-10-13 21:10:36,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:10:36,116 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:36,116 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:36,116 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:36,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1625636341, now seen corresponding path program 1 times [2019-10-13 21:10:36,117 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:36,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901236862] [2019-10-13 21:10:36,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,117 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:36,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:36,262 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,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901236862] [2019-10-13 21:10:36,263 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:36,263 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:10:36,263 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678733761] [2019-10-13 21:10:36,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:10:36,265 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:36,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:10:36,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:36,265 INFO L87 Difference]: Start difference. First operand 554 states and 883 transitions. Second operand 8 states. [2019-10-13 21:10:41,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,715 INFO L93 Difference]: Finished difference Result 1942 states and 3227 transitions. [2019-10-13 21:10:41,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:10:41,716 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-13 21:10:41,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,728 INFO L225 Difference]: With dead ends: 1942 [2019-10-13 21:10:41,728 INFO L226 Difference]: Without dead ends: 1454 [2019-10-13 21:10:41,732 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:41,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2019-10-13 21:10:41,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1415. [2019-10-13 21:10:41,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1415 states. [2019-10-13 21:10:41,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2280 transitions. [2019-10-13 21:10:41,812 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2280 transitions. Word has length 122 [2019-10-13 21:10:41,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,812 INFO L462 AbstractCegarLoop]: Abstraction has 1415 states and 2280 transitions. [2019-10-13 21:10:41,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:10:41,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2280 transitions. [2019-10-13 21:10:41,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:10:41,816 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,816 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:41,816 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash -430074642, now seen corresponding path program 1 times [2019-10-13 21:10:41,817 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908016155] [2019-10-13 21:10:41,817 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,818 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:42,016 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:42,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908016155] [2019-10-13 21:10:42,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:42,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:10:42,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703602264] [2019-10-13 21:10:42,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:42,018 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:42,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:42,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:10:42,018 INFO L87 Difference]: Start difference. First operand 1415 states and 2280 transitions. Second operand 9 states. [2019-10-13 21:10:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:48,742 INFO L93 Difference]: Finished difference Result 4546 states and 7547 transitions. [2019-10-13 21:10:48,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:10:48,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-13 21:10:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:48,767 INFO L225 Difference]: With dead ends: 4546 [2019-10-13 21:10:48,767 INFO L226 Difference]: Without dead ends: 3197 [2019-10-13 21:10:48,774 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:48,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3197 states. [2019-10-13 21:10:48,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3197 to 2974. [2019-10-13 21:10:48,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2974 states. [2019-10-13 21:10:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2974 states to 2974 states and 4851 transitions. [2019-10-13 21:10:48,917 INFO L78 Accepts]: Start accepts. Automaton has 2974 states and 4851 transitions. Word has length 128 [2019-10-13 21:10:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:48,918 INFO L462 AbstractCegarLoop]: Abstraction has 2974 states and 4851 transitions. [2019-10-13 21:10:48,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 2974 states and 4851 transitions. [2019-10-13 21:10:48,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:10:48,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:48,921 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:48,921 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:48,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:48,922 INFO L82 PathProgramCache]: Analyzing trace with hash -437834001, now seen corresponding path program 1 times [2019-10-13 21:10:48,922 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:48,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879320356] [2019-10-13 21:10:48,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:48,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:48,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:48,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:49,044 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:49,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879320356] [2019-10-13 21:10:49,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:49,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:49,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548854747] [2019-10-13 21:10:49,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:49,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:49,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:49,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:49,046 INFO L87 Difference]: Start difference. First operand 2974 states and 4851 transitions. Second operand 7 states. [2019-10-13 21:10:52,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:52,888 INFO L93 Difference]: Finished difference Result 7648 states and 12691 transitions. [2019-10-13 21:10:52,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:10:52,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-13 21:10:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:52,957 INFO L225 Difference]: With dead ends: 7648 [2019-10-13 21:10:52,957 INFO L226 Difference]: Without dead ends: 5510 [2019-10-13 21:10:52,977 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:10:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5510 states. [2019-10-13 21:10:53,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5510 to 5417. [2019-10-13 21:10:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5417 states. [2019-10-13 21:10:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5417 states to 5417 states and 8909 transitions. [2019-10-13 21:10:53,406 INFO L78 Accepts]: Start accepts. Automaton has 5417 states and 8909 transitions. Word has length 128 [2019-10-13 21:10:53,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:53,407 INFO L462 AbstractCegarLoop]: Abstraction has 5417 states and 8909 transitions. [2019-10-13 21:10:53,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 5417 states and 8909 transitions. [2019-10-13 21:10:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:10:53,411 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:53,411 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, 1, 1, 1, 1, 1] [2019-10-13 21:10:53,411 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash -630018540, now seen corresponding path program 1 times [2019-10-13 21:10:53,412 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:53,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104983883] [2019-10-13 21:10:53,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:53,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:53,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:53,543 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:53,543 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104983883] [2019-10-13 21:10:53,543 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:53,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:10:53,544 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214861507] [2019-10-13 21:10:53,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:53,545 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:53,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:53,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:53,545 INFO L87 Difference]: Start difference. First operand 5417 states and 8909 transitions. Second operand 5 states. [2019-10-13 21:10:53,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:53,805 INFO L93 Difference]: Finished difference Result 10006 states and 16543 transitions. [2019-10-13 21:10:53,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:10:53,806 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-13 21:10:53,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:53,873 INFO L225 Difference]: With dead ends: 10006 [2019-10-13 21:10:53,873 INFO L226 Difference]: Without dead ends: 5535 [2019-10-13 21:10:53,902 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:53,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5535 states. [2019-10-13 21:10:54,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5535 to 5469. [2019-10-13 21:10:54,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-10-13 21:10:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 8982 transitions. [2019-10-13 21:10:54,183 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 8982 transitions. Word has length 133 [2019-10-13 21:10:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:54,185 INFO L462 AbstractCegarLoop]: Abstraction has 5469 states and 8982 transitions. [2019-10-13 21:10:54,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:10:54,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 8982 transitions. [2019-10-13 21:10:54,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:10:54,189 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:54,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:54,189 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:54,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:54,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1275605709, now seen corresponding path program 1 times [2019-10-13 21:10:54,190 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:54,190 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808713493] [2019-10-13 21:10:54,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:54,190 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:54,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:54,318 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:54,319 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808713493] [2019-10-13 21:10:54,319 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:54,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:54,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364207204] [2019-10-13 21:10:54,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:54,320 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:54,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:54,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:54,321 INFO L87 Difference]: Start difference. First operand 5469 states and 8982 transitions. Second operand 7 states. [2019-10-13 21:10:54,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:54,677 INFO L93 Difference]: Finished difference Result 10582 states and 17659 transitions. [2019-10-13 21:10:54,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:54,678 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2019-10-13 21:10:54,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:54,719 INFO L225 Difference]: With dead ends: 10582 [2019-10-13 21:10:54,719 INFO L226 Difference]: Without dead ends: 5469 [2019-10-13 21:10:54,744 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5469 states. [2019-10-13 21:10:54,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5469 to 5469. [2019-10-13 21:10:54,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5469 states. [2019-10-13 21:10:55,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5469 states to 5469 states and 8890 transitions. [2019-10-13 21:10:55,006 INFO L78 Accepts]: Start accepts. Automaton has 5469 states and 8890 transitions. Word has length 140 [2019-10-13 21:10:55,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:55,006 INFO L462 AbstractCegarLoop]: Abstraction has 5469 states and 8890 transitions. [2019-10-13 21:10:55,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:55,007 INFO L276 IsEmpty]: Start isEmpty. Operand 5469 states and 8890 transitions. [2019-10-13 21:10:55,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:10:55,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:55,011 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:55,011 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:55,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:55,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1809403985, now seen corresponding path program 1 times [2019-10-13 21:10:55,011 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:55,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248971952] [2019-10-13 21:10:55,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:55,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:55,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:55,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:55,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 21:10:55,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248971952] [2019-10-13 21:10:55,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:55,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:55,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386340259] [2019-10-13 21:10:55,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:55,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:55,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:55,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:55,129 INFO L87 Difference]: Start difference. First operand 5469 states and 8890 transitions. Second operand 7 states.