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_product01.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:10:20,602 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:10:20,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:10:20,625 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:10:20,626 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:10:20,628 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:10:20,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:10:20,641 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:10:20,645 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:10:20,649 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:10:20,651 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:10:20,652 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:10:20,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:10:20,655 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:10:20,658 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:10:20,659 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:10:20,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:10:20,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:10:20,663 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:10:20,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:10:20,666 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:10:20,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:10:20,671 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:10:20,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:10:20,674 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:10:20,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:10:20,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:10:20,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:10:20,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:10:20,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:10:20,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:10:20,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:10:20,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:10:20,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:10:20,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:10:20,684 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:10:20,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:10:20,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:10:20,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:10:20,686 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:10:20,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:10:20,689 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:20,722 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:10:20,722 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:10:20,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:10:20,727 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:10:20,727 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:10:20,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:10:20,727 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:10:20,728 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:10:20,728 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:10:20,728 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:10:20,730 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:10:20,730 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:10:20,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:10:20,731 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:10:20,731 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:10:20,731 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:10:20,731 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:10:20,732 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:10:20,732 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:10:20,732 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:10:20,732 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:10:20,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:10:20,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:10:20,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:10:20,733 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:10:20,733 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:10:20,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:10:20,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:10:20,734 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:21,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:10:21,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:10:21,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:10:21,066 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:10:21,066 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:10:21,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c [2019-10-13 21:10:21,131 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d81dc75b9/cca072c9c4a74e01bbc279cd7edbac62/FLAGb8701b7b6 [2019-10-13 21:10:21,738 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:10:21,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product01.cil.c [2019-10-13 21:10:21,758 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d81dc75b9/cca072c9c4a74e01bbc279cd7edbac62/FLAGb8701b7b6 [2019-10-13 21:10:21,968 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d81dc75b9/cca072c9c4a74e01bbc279cd7edbac62 [2019-10-13 21:10:21,980 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:10:21,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:10:21,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:21,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:10:21,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:10:21,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:21" (1/1) ... [2019-10-13 21:10:21,990 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67af7f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:21, skipping insertion in model container [2019-10-13 21:10:21,990 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:10:21" (1/1) ... [2019-10-13 21:10:21,998 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:10:22,083 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:10:22,921 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:22,946 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:10:23,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:10:23,204 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:10:23,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23 WrapperNode [2019-10-13 21:10:23,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:10:23,206 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:10:23,206 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:10:23,206 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:10:23,222 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:23" (1/1) ... [2019-10-13 21:10:23,223 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:23" (1/1) ... [2019-10-13 21:10:23,273 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:23" (1/1) ... [2019-10-13 21:10:23,274 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:23" (1/1) ... [2019-10-13 21:10:23,330 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:23" (1/1) ... [2019-10-13 21:10:23,352 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:23" (1/1) ... [2019-10-13 21:10:23,361 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:23" (1/1) ... [2019-10-13 21:10:23,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:10:23,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:10:23,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:10:23,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:10:23,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (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:23,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:10:23,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:10:23,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:23,455 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:10:23,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:10:23,456 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:10:23,457 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:10:23,457 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:10:23,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:23,458 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:23,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:23,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:23,459 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:23,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:23,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:23,460 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:10:23,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:10:23,463 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:10:23,463 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:10:23,464 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:10:23,465 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:10:23,465 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:10:23,465 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:10:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:10:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:10:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:10:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:10:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:10:23,466 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:10:23,467 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:10:23,467 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:10:23,467 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:10:23,467 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:10:23,467 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:10:23,467 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:10:23,468 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:10:23,468 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:10:23,468 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:10:23,468 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:10:23,468 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:10:23,468 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:10:23,469 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:10:23,469 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:10:23,469 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:10:23,469 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:10:23,469 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:10:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:10:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:10:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:10:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:10:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:10:23,470 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:10:23,471 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:23,471 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:10:23,471 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:10:23,471 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:10:23,471 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:10:23,471 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:10:23,472 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:10:23,472 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:10:23,472 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:10:23,472 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:10:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:10:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:10:23,473 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:10:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:10:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:10:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:10:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:10:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:10:23,474 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:10:23,475 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:10:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:10:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:10:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:10:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:10:23,475 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:10:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:10:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:10:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:10:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:10:23,476 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:10:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:10:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-13 21:10:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-13 21:10:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-13 21:10:23,477 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-13 21:10:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:10:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:10:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:10:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:10:23,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:10:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:10:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:10:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:10:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:10:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:10:23,479 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:10:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:10:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:10:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:10:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:10:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:10:23,480 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:10:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:10:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:10:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:10:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:10:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:10:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:10:23,481 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:10:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:10:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:10:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:10:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:10:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:10:23,482 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:10:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:10:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:10:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:10:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:10:23,483 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:10:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:10:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:10:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:10:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:10:23,484 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:10:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:10:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:10:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:10:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:10:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:10:23,485 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:10:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:10:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:10:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:10:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:10:23,486 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:10:23,487 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:10:23,487 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:10:23,487 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:10:23,487 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:10:23,487 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:10:23,487 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:10:23,488 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:10:23,488 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:10:23,488 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:10:23,488 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:10:23,488 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:10:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:10:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:10:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:10:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:10:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:10:23,489 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:10:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:10:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:10:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:10:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:10:25,777 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:10:25,778 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:10:25,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:25 BoogieIcfgContainer [2019-10-13 21:10:25,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:10:25,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:10:25,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:10:25,784 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:10:25,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:10:21" (1/3) ... [2019-10-13 21:10:25,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5626a2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:25, skipping insertion in model container [2019-10-13 21:10:25,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:10:23" (2/3) ... [2019-10-13 21:10:25,786 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5626a2cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:10:25, skipping insertion in model container [2019-10-13 21:10:25,786 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:10:25" (3/3) ... [2019-10-13 21:10:25,787 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product01.cil.c [2019-10-13 21:10:25,797 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:10:25,808 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:10:25,823 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:10:25,859 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:10:25,860 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:10:25,860 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:10:25,860 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:10:25,860 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:10:25,860 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:10:25,860 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:10:25,861 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:10:25,905 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states. [2019-10-13 21:10:25,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 21:10:25,937 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:25,938 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:25,941 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:25,947 INFO L82 PathProgramCache]: Analyzing trace with hash 579631, now seen corresponding path program 1 times [2019-10-13 21:10:25,957 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:25,958 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697218553] [2019-10-13 21:10:25,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:25,958 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:25,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:26,674 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:26,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697218553] [2019-10-13 21:10:26,676 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:26,676 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:26,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998030506] [2019-10-13 21:10:26,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:26,684 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:26,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:26,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:26,699 INFO L87 Difference]: Start difference. First operand 721 states. Second operand 4 states. [2019-10-13 21:10:26,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:26,907 INFO L93 Difference]: Finished difference Result 1105 states and 1815 transitions. [2019-10-13 21:10:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:26,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 21:10:26,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:26,947 INFO L225 Difference]: With dead ends: 1105 [2019-10-13 21:10:26,947 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:10:26,958 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:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:10:27,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-13 21:10:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-13 21:10:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 909 transitions. [2019-10-13 21:10:27,069 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 909 transitions. Word has length 107 [2019-10-13 21:10:27,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:27,070 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 909 transitions. [2019-10-13 21:10:27,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:27,070 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 909 transitions. [2019-10-13 21:10:27,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 21:10:27,077 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:27,077 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,077 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:27,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:27,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1624649059, now seen corresponding path program 1 times [2019-10-13 21:10:27,078 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:27,079 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877065411] [2019-10-13 21:10:27,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,079 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:27,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:27,284 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,284 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877065411] [2019-10-13 21:10:27,285 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:27,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:27,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532354176] [2019-10-13 21:10:27,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:27,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:27,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:27,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:27,292 INFO L87 Difference]: Start difference. First operand 561 states and 909 transitions. Second operand 4 states. [2019-10-13 21:10:27,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:27,382 INFO L93 Difference]: Finished difference Result 1085 states and 1776 transitions. [2019-10-13 21:10:27,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:27,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-13 21:10:27,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:27,391 INFO L225 Difference]: With dead ends: 1085 [2019-10-13 21:10:27,391 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:10:27,407 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,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:10:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-13 21:10:27,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-13 21:10:27,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 908 transitions. [2019-10-13 21:10:27,473 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 908 transitions. Word has length 110 [2019-10-13 21:10:27,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:27,475 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 908 transitions. [2019-10-13 21:10:27,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:27,476 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 908 transitions. [2019-10-13 21:10:27,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-13 21:10:27,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:27,486 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:27,489 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:27,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:27,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1144681058, now seen corresponding path program 1 times [2019-10-13 21:10:27,492 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:27,492 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780589641] [2019-10-13 21:10:27,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,492 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:27,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:27,710 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,711 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780589641] [2019-10-13 21:10:27,711 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:27,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:27,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198391684] [2019-10-13 21:10:27,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:27,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:27,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:27,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:27,713 INFO L87 Difference]: Start difference. First operand 561 states and 908 transitions. Second operand 4 states. [2019-10-13 21:10:27,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:27,787 INFO L93 Difference]: Finished difference Result 1085 states and 1775 transitions. [2019-10-13 21:10:27,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:27,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-13 21:10:27,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:27,793 INFO L225 Difference]: With dead ends: 1085 [2019-10-13 21:10:27,793 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:10:27,796 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,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:10:27,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-13 21:10:27,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-13 21:10:27,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 907 transitions. [2019-10-13 21:10:27,825 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 907 transitions. Word has length 111 [2019-10-13 21:10:27,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:27,826 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 907 transitions. [2019-10-13 21:10:27,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:27,826 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 907 transitions. [2019-10-13 21:10:27,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 21:10:27,830 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:27,830 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:27,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:27,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:27,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1767474887, now seen corresponding path program 1 times [2019-10-13 21:10:27,831 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:27,831 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880487465] [2019-10-13 21:10:27,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,832 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:27,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:27,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:27,984 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,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880487465] [2019-10-13 21:10:27,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:27,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:27,986 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381502050] [2019-10-13 21:10:27,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:27,987 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:27,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:27,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:27,987 INFO L87 Difference]: Start difference. First operand 561 states and 907 transitions. Second operand 4 states. [2019-10-13 21:10:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,061 INFO L93 Difference]: Finished difference Result 1085 states and 1774 transitions. [2019-10-13 21:10:28,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:28,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 21:10:28,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,070 INFO L225 Difference]: With dead ends: 1085 [2019-10-13 21:10:28,070 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:10:28,075 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,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:10:28,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-13 21:10:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-13 21:10:28,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 906 transitions. [2019-10-13 21:10:28,114 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 906 transitions. Word has length 112 [2019-10-13 21:10:28,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,115 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 906 transitions. [2019-10-13 21:10:28,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:28,116 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 906 transitions. [2019-10-13 21:10:28,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 21:10:28,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,123 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,123 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,124 INFO L82 PathProgramCache]: Analyzing trace with hash 2078820218, now seen corresponding path program 1 times [2019-10-13 21:10:28,124 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335933431] [2019-10-13 21:10:28,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,125 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,295 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,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335933431] [2019-10-13 21:10:28,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:28,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143182824] [2019-10-13 21:10:28,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:28,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:28,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:28,300 INFO L87 Difference]: Start difference. First operand 561 states and 906 transitions. Second operand 4 states. [2019-10-13 21:10:28,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,359 INFO L93 Difference]: Finished difference Result 1085 states and 1773 transitions. [2019-10-13 21:10:28,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:28,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-13 21:10:28,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,366 INFO L225 Difference]: With dead ends: 1085 [2019-10-13 21:10:28,366 INFO L226 Difference]: Without dead ends: 561 [2019-10-13 21:10:28,369 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,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-13 21:10:28,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 561. [2019-10-13 21:10:28,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2019-10-13 21:10:28,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 905 transitions. [2019-10-13 21:10:28,402 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 905 transitions. Word has length 113 [2019-10-13 21:10:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,402 INFO L462 AbstractCegarLoop]: Abstraction has 561 states and 905 transitions. [2019-10-13 21:10:28,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:28,402 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 905 transitions. [2019-10-13 21:10:28,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:10:28,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,407 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:28,407 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1562015787, now seen corresponding path program 1 times [2019-10-13 21:10:28,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493345153] [2019-10-13 21:10:28,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,409 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:28,660 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,662 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493345153] [2019-10-13 21:10:28,663 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:28,663 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:10:28,663 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018313619] [2019-10-13 21:10:28,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:10:28,664 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:28,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:10:28,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:10:28,670 INFO L87 Difference]: Start difference. First operand 561 states and 905 transitions. Second operand 10 states. [2019-10-13 21:10:28,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:28,846 INFO L93 Difference]: Finished difference Result 1043 states and 1693 transitions. [2019-10-13 21:10:28,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:10:28,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-13 21:10:28,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:28,852 INFO L225 Difference]: With dead ends: 1043 [2019-10-13 21:10:28,852 INFO L226 Difference]: Without dead ends: 570 [2019-10-13 21:10:28,856 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:28,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-10-13 21:10:28,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-10-13 21:10:28,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-10-13 21:10:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 914 transitions. [2019-10-13 21:10:28,888 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 914 transitions. Word has length 114 [2019-10-13 21:10:28,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:28,889 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 914 transitions. [2019-10-13 21:10:28,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:10:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 914 transitions. [2019-10-13 21:10:28,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-13 21:10:28,897 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:28,897 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:10:28,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:28,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:28,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1142498956, now seen corresponding path program 1 times [2019-10-13 21:10:28,898 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:28,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411157884] [2019-10-13 21:10:28,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,899 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:28,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:28,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,053 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,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411157884] [2019-10-13 21:10:29,055 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,055 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:29,055 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937752726] [2019-10-13 21:10:29,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:29,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:29,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:29,057 INFO L87 Difference]: Start difference. First operand 568 states and 914 transitions. Second operand 4 states. [2019-10-13 21:10:29,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,138 INFO L93 Difference]: Finished difference Result 1091 states and 1779 transitions. [2019-10-13 21:10:29,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:29,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-13 21:10:29,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,148 INFO L225 Difference]: With dead ends: 1091 [2019-10-13 21:10:29,148 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:10:29,152 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,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:10:29,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:10:29,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:10:29,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 891 transitions. [2019-10-13 21:10:29,183 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 891 transitions. Word has length 114 [2019-10-13 21:10:29,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,183 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 891 transitions. [2019-10-13 21:10:29,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:29,184 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 891 transitions. [2019-10-13 21:10:29,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-13 21:10:29,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,190 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,191 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1780568648, now seen corresponding path program 1 times [2019-10-13 21:10:29,192 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,192 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126393124] [2019-10-13 21:10:29,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,499 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,501 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126393124] [2019-10-13 21:10:29,501 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:29,502 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736761984] [2019-10-13 21:10:29,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:29,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:29,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:29,504 INFO L87 Difference]: Start difference. First operand 555 states and 891 transitions. Second operand 6 states. [2019-10-13 21:10:29,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:29,767 INFO L93 Difference]: Finished difference Result 1031 states and 1671 transitions. [2019-10-13 21:10:29,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:29,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-13 21:10:29,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:29,773 INFO L225 Difference]: With dead ends: 1031 [2019-10-13 21:10:29,773 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:10:29,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:29,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:10:29,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:10:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:10:29,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 887 transitions. [2019-10-13 21:10:29,803 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 887 transitions. Word has length 115 [2019-10-13 21:10:29,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:29,804 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 887 transitions. [2019-10-13 21:10:29,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 887 transitions. [2019-10-13 21:10:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-13 21:10:29,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:29,809 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:29,809 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:29,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:29,810 INFO L82 PathProgramCache]: Analyzing trace with hash 38803032, now seen corresponding path program 1 times [2019-10-13 21:10:29,810 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:29,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842872059] [2019-10-13 21:10:29,810 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:29,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:29,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:29,956 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,956 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842872059] [2019-10-13 21:10:29,956 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:29,957 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:29,957 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095219578] [2019-10-13 21:10:29,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:29,958 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:29,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:29,959 INFO L87 Difference]: Start difference. First operand 555 states and 887 transitions. Second operand 6 states. [2019-10-13 21:10:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,166 INFO L93 Difference]: Finished difference Result 1031 states and 1667 transitions. [2019-10-13 21:10:30,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:30,170 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-13 21:10:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,177 INFO L225 Difference]: With dead ends: 1031 [2019-10-13 21:10:30,177 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:10:30,181 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,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:10:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:10:30,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:10:30,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 883 transitions. [2019-10-13 21:10:30,215 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 883 transitions. Word has length 116 [2019-10-13 21:10:30,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,215 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 883 transitions. [2019-10-13 21:10:30,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:30,216 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 883 transitions. [2019-10-13 21:10:30,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:10:30,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,219 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,220 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1813626371, now seen corresponding path program 1 times [2019-10-13 21:10:30,221 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,221 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296217286] [2019-10-13 21:10:30,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,221 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,373 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,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296217286] [2019-10-13 21:10:30,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:30,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116010091] [2019-10-13 21:10:30,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:30,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:30,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:30,377 INFO L87 Difference]: Start difference. First operand 555 states and 883 transitions. Second operand 6 states. [2019-10-13 21:10:30,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,598 INFO L93 Difference]: Finished difference Result 1031 states and 1663 transitions. [2019-10-13 21:10:30,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:30,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-13 21:10:30,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,604 INFO L225 Difference]: With dead ends: 1031 [2019-10-13 21:10:30,604 INFO L226 Difference]: Without dead ends: 555 [2019-10-13 21:10:30,611 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,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-13 21:10:30,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-13 21:10:30,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-13 21:10:30,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 879 transitions. [2019-10-13 21:10:30,632 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 879 transitions. Word has length 117 [2019-10-13 21:10:30,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,633 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 879 transitions. [2019-10-13 21:10:30,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:30,633 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 879 transitions. [2019-10-13 21:10:30,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-13 21:10:30,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,637 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,637 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1358766467, now seen corresponding path program 1 times [2019-10-13 21:10:30,637 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317669127] [2019-10-13 21:10:30,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:30,783 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,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317669127] [2019-10-13 21:10:30,784 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:30,784 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:30,784 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413716329] [2019-10-13 21:10:30,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:30,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:30,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:30,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:30,785 INFO L87 Difference]: Start difference. First operand 555 states and 879 transitions. Second operand 7 states. [2019-10-13 21:10:30,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:30,880 INFO L93 Difference]: Finished difference Result 1031 states and 1659 transitions. [2019-10-13 21:10:30,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:10:30,881 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-13 21:10:30,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:30,886 INFO L225 Difference]: With dead ends: 1031 [2019-10-13 21:10:30,886 INFO L226 Difference]: Without dead ends: 534 [2019-10-13 21:10:30,889 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:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-13 21:10:30,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-13 21:10:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-13 21:10:30,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 845 transitions. [2019-10-13 21:10:30,917 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 845 transitions. Word has length 117 [2019-10-13 21:10:30,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:30,918 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 845 transitions. [2019-10-13 21:10:30,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:30,918 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 845 transitions. [2019-10-13 21:10:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 21:10:30,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:30,923 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:30,924 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:30,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1527772355, now seen corresponding path program 1 times [2019-10-13 21:10:30,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:30,925 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130628048] [2019-10-13 21:10:30,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:30,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:30,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,079 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,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130628048] [2019-10-13 21:10:31,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,080 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:31,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141984466] [2019-10-13 21:10:31,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:31,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:31,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:31,082 INFO L87 Difference]: Start difference. First operand 534 states and 845 transitions. Second operand 6 states. [2019-10-13 21:10:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,184 INFO L93 Difference]: Finished difference Result 1010 states and 1625 transitions. [2019-10-13 21:10:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:31,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-13 21:10:31,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,189 INFO L225 Difference]: With dead ends: 1010 [2019-10-13 21:10:31,190 INFO L226 Difference]: Without dead ends: 534 [2019-10-13 21:10:31,193 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,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-13 21:10:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-13 21:10:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-13 21:10:31,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 844 transitions. [2019-10-13 21:10:31,214 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 844 transitions. Word has length 118 [2019-10-13 21:10:31,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,216 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 844 transitions. [2019-10-13 21:10:31,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 844 transitions. [2019-10-13 21:10:31,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-13 21:10:31,220 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,220 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,221 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,221 INFO L82 PathProgramCache]: Analyzing trace with hash 620358210, now seen corresponding path program 1 times [2019-10-13 21:10:31,222 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,222 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053549741] [2019-10-13 21:10:31,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,222 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,358 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,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053549741] [2019-10-13 21:10:31,359 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,359 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:10:31,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997015541] [2019-10-13 21:10:31,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:10:31,360 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:10:31,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:10:31,361 INFO L87 Difference]: Start difference. First operand 534 states and 844 transitions. Second operand 6 states. [2019-10-13 21:10:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,483 INFO L93 Difference]: Finished difference Result 1010 states and 1624 transitions. [2019-10-13 21:10:31,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:10:31,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-13 21:10:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,488 INFO L225 Difference]: With dead ends: 1010 [2019-10-13 21:10:31,489 INFO L226 Difference]: Without dead ends: 534 [2019-10-13 21:10:31,491 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,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-13 21:10:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-13 21:10:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-13 21:10:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 843 transitions. [2019-10-13 21:10:31,512 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 843 transitions. Word has length 119 [2019-10-13 21:10:31,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,514 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 843 transitions. [2019-10-13 21:10:31,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:10:31,514 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 843 transitions. [2019-10-13 21:10:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:10:31,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,522 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,522 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash -597831004, now seen corresponding path program 1 times [2019-10-13 21:10:31,523 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263136399] [2019-10-13 21:10:31,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,523 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,660 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,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263136399] [2019-10-13 21:10:31,661 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,661 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:10:31,661 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2678044] [2019-10-13 21:10:31,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:10:31,663 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:10:31,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:10:31,664 INFO L87 Difference]: Start difference. First operand 534 states and 843 transitions. Second operand 4 states. [2019-10-13 21:10:31,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:31,720 INFO L93 Difference]: Finished difference Result 1010 states and 1623 transitions. [2019-10-13 21:10:31,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:10:31,721 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-10-13 21:10:31,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:31,725 INFO L225 Difference]: With dead ends: 1010 [2019-10-13 21:10:31,726 INFO L226 Difference]: Without dead ends: 534 [2019-10-13 21:10:31,729 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,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-13 21:10:31,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-13 21:10:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-13 21:10:31,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 842 transitions. [2019-10-13 21:10:31,752 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 842 transitions. Word has length 120 [2019-10-13 21:10:31,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:31,752 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 842 transitions. [2019-10-13 21:10:31,752 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:10:31,753 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 842 transitions. [2019-10-13 21:10:31,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-13 21:10:31,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:31,759 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,759 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:31,759 INFO L82 PathProgramCache]: Analyzing trace with hash 369519650, now seen corresponding path program 1 times [2019-10-13 21:10:31,759 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:31,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971046930] [2019-10-13 21:10:31,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,760 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:31,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:31,968 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,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971046930] [2019-10-13 21:10:31,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:31,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:10:31,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723904563] [2019-10-13 21:10:31,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:10:31,971 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:31,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:10:31,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:10:31,972 INFO L87 Difference]: Start difference. First operand 534 states and 842 transitions. Second operand 12 states. [2019-10-13 21:10:32,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:32,153 INFO L93 Difference]: Finished difference Result 1011 states and 1622 transitions. [2019-10-13 21:10:32,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:10:32,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-13 21:10:32,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:32,158 INFO L225 Difference]: With dead ends: 1011 [2019-10-13 21:10:32,158 INFO L226 Difference]: Without dead ends: 534 [2019-10-13 21:10:32,163 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:10:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-10-13 21:10:32,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 534. [2019-10-13 21:10:32,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 534 states. [2019-10-13 21:10:32,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 841 transitions. [2019-10-13 21:10:32,186 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 841 transitions. Word has length 120 [2019-10-13 21:10:32,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:32,186 INFO L462 AbstractCegarLoop]: Abstraction has 534 states and 841 transitions. [2019-10-13 21:10:32,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:10:32,186 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 841 transitions. [2019-10-13 21:10:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-13 21:10:32,190 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:32,190 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,190 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash 718640905, now seen corresponding path program 1 times [2019-10-13 21:10:32,191 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:32,191 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952694145] [2019-10-13 21:10:32,191 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,192 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:32,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:32,380 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,386 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952694145] [2019-10-13 21:10:32,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:32,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:10:32,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229568795] [2019-10-13 21:10:32,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:32,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:32,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:32,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:10:32,391 INFO L87 Difference]: Start difference. First operand 534 states and 841 transitions. Second operand 9 states. [2019-10-13 21:10:35,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:35,780 INFO L93 Difference]: Finished difference Result 1008 states and 1636 transitions. [2019-10-13 21:10:35,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:10:35,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-13 21:10:35,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:35,785 INFO L225 Difference]: With dead ends: 1008 [2019-10-13 21:10:35,786 INFO L226 Difference]: Without dead ends: 540 [2019-10-13 21:10:35,789 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:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-10-13 21:10:35,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 538. [2019-10-13 21:10:35,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-13 21:10:35,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 860 transitions. [2019-10-13 21:10:35,821 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 860 transitions. Word has length 121 [2019-10-13 21:10:35,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:35,822 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 860 transitions. [2019-10-13 21:10:35,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:35,822 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 860 transitions. [2019-10-13 21:10:35,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-13 21:10:35,825 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:35,826 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:35,826 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:35,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:35,826 INFO L82 PathProgramCache]: Analyzing trace with hash 1721131710, now seen corresponding path program 1 times [2019-10-13 21:10:35,827 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:35,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755379247] [2019-10-13 21:10:35,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:35,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:35,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:36,006 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,007 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755379247] [2019-10-13 21:10:36,007 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:36,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-13 21:10:36,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856807043] [2019-10-13 21:10:36,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 21:10:36,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 21:10:36,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:10:36,009 INFO L87 Difference]: Start difference. First operand 538 states and 860 transitions. Second operand 8 states. [2019-10-13 21:10:41,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:41,540 INFO L93 Difference]: Finished difference Result 1878 states and 3135 transitions. [2019-10-13 21:10:41,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 21:10:41,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-13 21:10:41,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:41,555 INFO L225 Difference]: With dead ends: 1878 [2019-10-13 21:10:41,555 INFO L226 Difference]: Without dead ends: 1406 [2019-10-13 21:10:41,560 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,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2019-10-13 21:10:41,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1367. [2019-10-13 21:10:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1367 states. [2019-10-13 21:10:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1367 states to 1367 states and 2211 transitions. [2019-10-13 21:10:41,630 INFO L78 Accepts]: Start accepts. Automaton has 1367 states and 2211 transitions. Word has length 122 [2019-10-13 21:10:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:41,630 INFO L462 AbstractCegarLoop]: Abstraction has 1367 states and 2211 transitions. [2019-10-13 21:10:41,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 21:10:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2211 transitions. [2019-10-13 21:10:41,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:10:41,634 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:41,634 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,634 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:41,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:41,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1283805034, now seen corresponding path program 1 times [2019-10-13 21:10:41,635 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:41,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605819256] [2019-10-13 21:10:41,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:41,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:41,785 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:41,786 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605819256] [2019-10-13 21:10:41,786 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:41,786 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:10:41,786 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044898485] [2019-10-13 21:10:41,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:10:41,787 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:41,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:10:41,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:10:41,788 INFO L87 Difference]: Start difference. First operand 1367 states and 2211 transitions. Second operand 9 states. [2019-10-13 21:10:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:48,424 INFO L93 Difference]: Finished difference Result 4315 states and 7169 transitions. [2019-10-13 21:10:48,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 21:10:48,424 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-13 21:10:48,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:48,450 INFO L225 Difference]: With dead ends: 4315 [2019-10-13 21:10:48,450 INFO L226 Difference]: Without dead ends: 3014 [2019-10-13 21:10:48,461 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,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3014 states. [2019-10-13 21:10:48,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3014 to 2791. [2019-10-13 21:10:48,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2019-10-13 21:10:48,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 4542 transitions. [2019-10-13 21:10:48,674 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 4542 transitions. Word has length 128 [2019-10-13 21:10:48,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:48,674 INFO L462 AbstractCegarLoop]: Abstraction has 2791 states and 4542 transitions. [2019-10-13 21:10:48,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:10:48,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 4542 transitions. [2019-10-13 21:10:48,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-13 21:10:48,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:48,678 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,678 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1276045675, now seen corresponding path program 1 times [2019-10-13 21:10:48,679 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:48,679 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910550523] [2019-10-13 21:10:48,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:48,679 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:48,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:48,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:48,817 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:48,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910550523] [2019-10-13 21:10:48,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:48,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:10:48,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278208409] [2019-10-13 21:10:48,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:10:48,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:10:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:10:48,821 INFO L87 Difference]: Start difference. First operand 2791 states and 4542 transitions. Second operand 7 states. [2019-10-13 21:10:52,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:10:52,904 INFO L93 Difference]: Finished difference Result 7221 states and 11970 transitions. [2019-10-13 21:10:52,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 21:10:52,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 128 [2019-10-13 21:10:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:10:52,953 INFO L225 Difference]: With dead ends: 7221 [2019-10-13 21:10:52,953 INFO L226 Difference]: Without dead ends: 5205 [2019-10-13 21:10:52,968 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,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5205 states. [2019-10-13 21:10:53,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5205 to 5112. [2019-10-13 21:10:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2019-10-13 21:10:53,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 8394 transitions. [2019-10-13 21:10:53,238 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 8394 transitions. Word has length 128 [2019-10-13 21:10:53,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:10:53,239 INFO L462 AbstractCegarLoop]: Abstraction has 5112 states and 8394 transitions. [2019-10-13 21:10:53,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:10:53,239 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 8394 transitions. [2019-10-13 21:10:53,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-13 21:10:53,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:10:53,243 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,243 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:10:53,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:10:53,243 INFO L82 PathProgramCache]: Analyzing trace with hash 421466230, now seen corresponding path program 1 times [2019-10-13 21:10:53,244 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:10:53,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612389314] [2019-10-13 21:10:53,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:53,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:10:53,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:10:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:10:53,426 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,426 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612389314] [2019-10-13 21:10:53,426 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:10:53,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:10:53,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094396940] [2019-10-13 21:10:53,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:10:53,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:10:53,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:10:53,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:10:53,428 INFO L87 Difference]: Start difference. First operand 5112 states and 8394 transitions. Second operand 5 states.