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 -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:16:43,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:16:43,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:16:43,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:16:43,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:16:43,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:16:43,610 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:16:43,611 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:16:43,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:16:43,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:16:43,615 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:16:43,616 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:16:43,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:16:43,617 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:16:43,618 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:16:43,619 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:16:43,620 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:16:43,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:16:43,623 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:16:43,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:16:43,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:16:43,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:16:43,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:16:43,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:16:43,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:16:43,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:16:43,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:16:43,633 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:16:43,634 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:16:43,635 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:16:43,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:16:43,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:16:43,638 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:16:43,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:16:43,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:16:43,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:16:43,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:16:43,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:16:43,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:16:43,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:16:43,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:16:43,648 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-02 12:16:43,673 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:16:43,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:16:43,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:16:43,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:16:43,675 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:16:43,675 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:16:43,676 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:16:43,676 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:16:43,676 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:16:43,676 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:16:43,677 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:16:43,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:16:43,677 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:16:43,678 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:16:43,678 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:16:43,678 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:16:43,678 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:16:43,679 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:16:43,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:16:43,679 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:16:43,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:16:43,680 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:16:43,680 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:16:43,680 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:16:43,680 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:16:43,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:16:43,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:16:43,681 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:16:43,681 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:16:43,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:16:43,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:16:43,732 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:16:43,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:16:43,734 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:16:43,735 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product20.cil.c [2019-10-02 12:16:43,792 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89059a2ab/91087d53e8f349c8b6aeefebc88925f8/FLAGe01422958 [2019-10-02 12:16:44,417 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:16:44,418 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product20.cil.c [2019-10-02 12:16:44,437 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89059a2ab/91087d53e8f349c8b6aeefebc88925f8/FLAGe01422958 [2019-10-02 12:16:44,616 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89059a2ab/91087d53e8f349c8b6aeefebc88925f8 [2019-10-02 12:16:44,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:16:44,627 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:16:44,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:16:44,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:16:44,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:16:44,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:16:44" (1/1) ... [2019-10-02 12:16:44,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52d5ae8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:44, skipping insertion in model container [2019-10-02 12:16:44,636 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:16:44" (1/1) ... [2019-10-02 12:16:44,644 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:16:44,736 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:16:45,427 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:16:45,443 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:16:45,682 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:16:45,750 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:16:45,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45 WrapperNode [2019-10-02 12:16:45,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:16:45,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:16:45,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:16:45,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:16:45,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (1/1) ... [2019-10-02 12:16:45,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (1/1) ... [2019-10-02 12:16:45,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (1/1) ... [2019-10-02 12:16:45,803 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (1/1) ... [2019-10-02 12:16:45,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (1/1) ... [2019-10-02 12:16:45,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (1/1) ... [2019-10-02 12:16:45,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (1/1) ... [2019-10-02 12:16:45,945 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:16:45,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:16:45,947 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:16:45,947 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:16:45,948 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (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-02 12:16:46,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:16:46,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:16:46,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:16:46,012 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:16:46,013 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:16:46,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:16:46,014 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:16:46,014 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:16:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:16:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:16:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:16:46,015 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:16:46,016 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:16:46,016 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:16:46,017 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:16:46,017 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:16:46,019 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:16:46,020 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:16:46,020 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:16:46,020 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:16:46,020 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:16:46,020 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:16:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:16:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:16:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:16:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:16:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:16:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:16:46,021 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:16:46,022 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:16:46,023 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:16:46,023 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 12:16:46,023 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:16:46,023 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 12:16:46,023 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:16:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:16:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:16:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:16:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:16:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:16:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:16:46,024 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:16:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:16:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:16:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:16:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:16:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:16:46,025 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:16:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:16:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:16:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:16:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:16:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:16:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:16:46,026 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:16:46,027 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:16:46,027 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:16:46,027 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:16:46,027 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:16:46,028 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:16:46,028 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:16:46,028 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:16:46,028 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:16:46,028 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:16:46,028 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:16:46,029 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:16:46,029 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:16:46,029 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:16:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:16:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:16:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:16:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:16:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:16:46,030 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:16:46,031 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:16:46,031 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:16:46,032 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:16:46,032 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:16:46,032 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:16:46,032 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:16:46,032 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:16:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:16:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:16:46,033 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:16:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:16:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:16:46,034 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:16:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:16:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:16:46,035 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:16:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:16:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:16:46,036 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:16:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:16:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:16:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:16:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:16:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:16:46,037 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:16:46,038 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:16:46,038 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:16:46,038 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:16:46,038 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:16:46,038 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:16:46,039 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:16:46,039 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:16:46,039 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:16:46,039 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:16:46,039 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:16:46,040 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:16:46,040 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:16:46,040 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:16:46,040 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:16:46,040 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:16:46,040 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:16:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:16:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:16:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:16:46,041 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:16:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:16:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:16:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:16:46,042 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:16:46,043 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:16:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 12:16:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 12:16:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:16:46,044 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:16:46,045 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:16:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:16:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:16:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:16:46,046 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:16:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:16:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:16:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:16:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:16:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:16:46,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:16:46,048 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:16:46,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:16:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:16:46,052 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:16:46,053 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:16:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:16:46,060 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:16:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:16:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:16:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:16:46,061 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:16:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:16:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:16:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:16:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:16:46,062 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:16:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:16:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:16:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:16:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:16:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:16:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:16:46,063 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:16:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:16:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:16:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:16:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:16:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:16:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:16:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:16:46,064 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:16:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:16:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:16:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:16:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:16:46,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:16:48,200 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:16:48,200 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:16:48,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:48 BoogieIcfgContainer [2019-10-02 12:16:48,202 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:16:48,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:16:48,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:16:48,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:16:48,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:16:44" (1/3) ... [2019-10-02 12:16:48,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212a85e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:48, skipping insertion in model container [2019-10-02 12:16:48,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:16:45" (2/3) ... [2019-10-02 12:16:48,211 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@212a85e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:16:48, skipping insertion in model container [2019-10-02 12:16:48,211 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:16:48" (3/3) ... [2019-10-02 12:16:48,212 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product20.cil.c [2019-10-02 12:16:48,222 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:16:48,236 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:16:48,252 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:16:48,307 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:16:48,308 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:16:48,308 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:16:48,308 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:16:48,309 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:16:48,309 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:16:48,309 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:16:48,309 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:16:48,309 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:16:48,352 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states. [2019-10-02 12:16:48,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 12:16:48,370 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:48,371 INFO L411 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] [2019-10-02 12:16:48,373 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:48,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash 64151631, now seen corresponding path program 1 times [2019-10-02 12:16:48,379 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:48,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:48,434 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:48,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:48,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:48,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:48,972 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-02 12:16:48,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:48,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:48,979 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:48,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:48,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:48,996 INFO L87 Difference]: Start difference. First operand 786 states. Second operand 4 states. [2019-10-02 12:16:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:49,228 INFO L93 Difference]: Finished difference Result 1221 states and 1969 transitions. [2019-10-02 12:16:49,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:16:49,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-02 12:16:49,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:49,262 INFO L225 Difference]: With dead ends: 1221 [2019-10-02 12:16:49,262 INFO L226 Difference]: Without dead ends: 619 [2019-10-02 12:16:49,275 INFO L640 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-02 12:16:49,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-02 12:16:49,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-02 12:16:49,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-02 12:16:49,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 986 transitions. [2019-10-02 12:16:49,409 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 986 transitions. Word has length 85 [2019-10-02 12:16:49,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:49,410 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 986 transitions. [2019-10-02 12:16:49,410 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:49,410 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 986 transitions. [2019-10-02 12:16:49,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 12:16:49,424 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:49,424 INFO L411 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] [2019-10-02 12:16:49,424 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:49,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:49,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1001440901, now seen corresponding path program 1 times [2019-10-02 12:16:49,425 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:49,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:49,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:49,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:49,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:49,604 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-02 12:16:49,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:49,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:49,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:49,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:49,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:49,607 INFO L87 Difference]: Start difference. First operand 619 states and 986 transitions. Second operand 4 states. [2019-10-02 12:16:49,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:49,680 INFO L93 Difference]: Finished difference Result 1201 states and 1930 transitions. [2019-10-02 12:16:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:16:49,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-02 12:16:49,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:49,686 INFO L225 Difference]: With dead ends: 1201 [2019-10-02 12:16:49,686 INFO L226 Difference]: Without dead ends: 619 [2019-10-02 12:16:49,689 INFO L640 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-02 12:16:49,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-02 12:16:49,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-02 12:16:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-02 12:16:49,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 985 transitions. [2019-10-02 12:16:49,738 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 985 transitions. Word has length 88 [2019-10-02 12:16:49,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:49,738 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 985 transitions. [2019-10-02 12:16:49,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:49,738 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 985 transitions. [2019-10-02 12:16:49,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 12:16:49,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:49,744 INFO L411 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] [2019-10-02 12:16:49,744 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:49,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:49,746 INFO L82 PathProgramCache]: Analyzing trace with hash 271669182, now seen corresponding path program 1 times [2019-10-02 12:16:49,746 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:49,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:49,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:49,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:49,950 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-02 12:16:49,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:49,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:49,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:49,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:49,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:49,953 INFO L87 Difference]: Start difference. First operand 619 states and 985 transitions. Second operand 4 states. [2019-10-02 12:16:50,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:50,014 INFO L93 Difference]: Finished difference Result 1201 states and 1929 transitions. [2019-10-02 12:16:50,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:16:50,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-02 12:16:50,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:50,020 INFO L225 Difference]: With dead ends: 1201 [2019-10-02 12:16:50,020 INFO L226 Difference]: Without dead ends: 619 [2019-10-02 12:16:50,023 INFO L640 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-02 12:16:50,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-02 12:16:50,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-02 12:16:50,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-02 12:16:50,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 984 transitions. [2019-10-02 12:16:50,056 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 984 transitions. Word has length 89 [2019-10-02 12:16:50,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:50,056 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 984 transitions. [2019-10-02 12:16:50,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:50,056 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 984 transitions. [2019-10-02 12:16:50,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 12:16:50,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:50,059 INFO L411 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] [2019-10-02 12:16:50,059 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:50,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:50,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1164725591, now seen corresponding path program 1 times [2019-10-02 12:16:50,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:50,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:50,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:50,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:50,280 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-02 12:16:50,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:50,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:50,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:50,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:50,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:50,282 INFO L87 Difference]: Start difference. First operand 619 states and 984 transitions. Second operand 4 states. [2019-10-02 12:16:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:50,346 INFO L93 Difference]: Finished difference Result 1201 states and 1928 transitions. [2019-10-02 12:16:50,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:16:50,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 12:16:50,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:50,361 INFO L225 Difference]: With dead ends: 1201 [2019-10-02 12:16:50,362 INFO L226 Difference]: Without dead ends: 619 [2019-10-02 12:16:50,367 INFO L640 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-02 12:16:50,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-02 12:16:50,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-02 12:16:50,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-02 12:16:50,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 983 transitions. [2019-10-02 12:16:50,401 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 983 transitions. Word has length 90 [2019-10-02 12:16:50,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:50,401 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 983 transitions. [2019-10-02 12:16:50,402 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:50,402 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 983 transitions. [2019-10-02 12:16:50,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 12:16:50,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:50,404 INFO L411 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] [2019-10-02 12:16:50,404 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:50,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:50,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1133947302, now seen corresponding path program 1 times [2019-10-02 12:16:50,405 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:50,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:50,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:50,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:50,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:50,520 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-02 12:16:50,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:50,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:50,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:50,522 INFO L87 Difference]: Start difference. First operand 619 states and 983 transitions. Second operand 4 states. [2019-10-02 12:16:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:50,593 INFO L93 Difference]: Finished difference Result 1201 states and 1927 transitions. [2019-10-02 12:16:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:16:50,593 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 12:16:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:50,598 INFO L225 Difference]: With dead ends: 1201 [2019-10-02 12:16:50,598 INFO L226 Difference]: Without dead ends: 619 [2019-10-02 12:16:50,601 INFO L640 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-02 12:16:50,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-10-02 12:16:50,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 619. [2019-10-02 12:16:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-02 12:16:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 982 transitions. [2019-10-02 12:16:50,622 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 982 transitions. Word has length 91 [2019-10-02 12:16:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:50,622 INFO L475 AbstractCegarLoop]: Abstraction has 619 states and 982 transitions. [2019-10-02 12:16:50,622 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 982 transitions. [2019-10-02 12:16:50,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:16:50,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:50,624 INFO L411 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] [2019-10-02 12:16:50,624 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 702986547, now seen corresponding path program 1 times [2019-10-02 12:16:50,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:50,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:50,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:50,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:50,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:50,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:50,794 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-02 12:16:50,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:50,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:16:50,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:16:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:16:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:16:50,796 INFO L87 Difference]: Start difference. First operand 619 states and 982 transitions. Second operand 10 states. [2019-10-02 12:16:50,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:50,968 INFO L93 Difference]: Finished difference Result 1159 states and 1847 transitions. [2019-10-02 12:16:50,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:16:50,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-02 12:16:50,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:50,980 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 12:16:50,980 INFO L226 Difference]: Without dead ends: 628 [2019-10-02 12:16:50,986 INFO L640 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-02 12:16:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-10-02 12:16:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 626. [2019-10-02 12:16:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:16:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 991 transitions. [2019-10-02 12:16:51,040 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 991 transitions. Word has length 92 [2019-10-02 12:16:51,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:51,042 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 991 transitions. [2019-10-02 12:16:51,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:16:51,042 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 991 transitions. [2019-10-02 12:16:51,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:16:51,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:51,047 INFO L411 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] [2019-10-02 12:16:51,048 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:51,048 INFO L82 PathProgramCache]: Analyzing trace with hash 723323922, now seen corresponding path program 1 times [2019-10-02 12:16:51,049 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:51,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:51,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:51,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:51,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:51,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:51,196 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-02 12:16:51,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:51,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:51,197 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:51,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:51,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:51,199 INFO L87 Difference]: Start difference. First operand 626 states and 991 transitions. Second operand 4 states. [2019-10-02 12:16:51,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:51,318 INFO L93 Difference]: Finished difference Result 1207 states and 1933 transitions. [2019-10-02 12:16:51,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:16:51,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 12:16:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:51,323 INFO L225 Difference]: With dead ends: 1207 [2019-10-02 12:16:51,324 INFO L226 Difference]: Without dead ends: 613 [2019-10-02 12:16:51,327 INFO L640 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-02 12:16:51,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-02 12:16:51,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-02 12:16:51,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-02 12:16:51,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 968 transitions. [2019-10-02 12:16:51,350 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 968 transitions. Word has length 92 [2019-10-02 12:16:51,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:51,351 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 968 transitions. [2019-10-02 12:16:51,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:51,351 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 968 transitions. [2019-10-02 12:16:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:16:51,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:51,353 INFO L411 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] [2019-10-02 12:16:51,353 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:51,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1512255588, now seen corresponding path program 1 times [2019-10-02 12:16:51,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:51,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:51,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:51,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:51,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:51,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:51,482 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-02 12:16:51,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:51,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:51,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:51,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:51,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:51,484 INFO L87 Difference]: Start difference. First operand 613 states and 968 transitions. Second operand 6 states. [2019-10-02 12:16:51,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:51,698 INFO L93 Difference]: Finished difference Result 1147 states and 1825 transitions. [2019-10-02 12:16:51,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:16:51,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-02 12:16:51,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:51,705 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:16:51,705 INFO L226 Difference]: Without dead ends: 613 [2019-10-02 12:16:51,708 INFO L640 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-02 12:16:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-02 12:16:51,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-02 12:16:51,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-02 12:16:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 964 transitions. [2019-10-02 12:16:51,734 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 964 transitions. Word has length 93 [2019-10-02 12:16:51,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:51,734 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 964 transitions. [2019-10-02 12:16:51,734 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:16:51,734 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 964 transitions. [2019-10-02 12:16:51,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:16:51,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:51,736 INFO L411 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] [2019-10-02 12:16:51,736 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:51,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:51,737 INFO L82 PathProgramCache]: Analyzing trace with hash 917220790, now seen corresponding path program 1 times [2019-10-02 12:16:51,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:51,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:51,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:51,741 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:51,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:51,882 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-02 12:16:51,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:51,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:51,882 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:51,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:51,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:51,883 INFO L87 Difference]: Start difference. First operand 613 states and 964 transitions. Second operand 6 states. [2019-10-02 12:16:52,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:52,081 INFO L93 Difference]: Finished difference Result 1147 states and 1821 transitions. [2019-10-02 12:16:52,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:16:52,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-02 12:16:52,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:52,088 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:16:52,088 INFO L226 Difference]: Without dead ends: 613 [2019-10-02 12:16:52,092 INFO L640 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-02 12:16:52,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-02 12:16:52,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-02 12:16:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-02 12:16:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 960 transitions. [2019-10-02 12:16:52,119 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 960 transitions. Word has length 94 [2019-10-02 12:16:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:52,120 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 960 transitions. [2019-10-02 12:16:52,120 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:16:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 960 transitions. [2019-10-02 12:16:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:16:52,122 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:52,122 INFO L411 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] [2019-10-02 12:16:52,123 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash -387785559, now seen corresponding path program 1 times [2019-10-02 12:16:52,124 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:52,124 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:52,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:52,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:52,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:52,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:52,305 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-02 12:16:52,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:52,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:52,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:52,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:52,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:52,307 INFO L87 Difference]: Start difference. First operand 613 states and 960 transitions. Second operand 6 states. [2019-10-02 12:16:52,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:52,483 INFO L93 Difference]: Finished difference Result 1147 states and 1817 transitions. [2019-10-02 12:16:52,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:16:52,484 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 12:16:52,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:52,489 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:16:52,489 INFO L226 Difference]: Without dead ends: 613 [2019-10-02 12:16:52,492 INFO L640 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-02 12:16:52,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-10-02 12:16:52,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2019-10-02 12:16:52,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-10-02 12:16:52,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 956 transitions. [2019-10-02 12:16:52,514 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 956 transitions. Word has length 95 [2019-10-02 12:16:52,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:52,514 INFO L475 AbstractCegarLoop]: Abstraction has 613 states and 956 transitions. [2019-10-02 12:16:52,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:16:52,514 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 956 transitions. [2019-10-02 12:16:52,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:16:52,516 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:52,516 INFO L411 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] [2019-10-02 12:16:52,516 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash 660068649, now seen corresponding path program 1 times [2019-10-02 12:16:52,517 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:52,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:52,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:52,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:52,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:52,640 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-02 12:16:52,640 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:52,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:16:52,641 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:16:52,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:16:52,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:16:52,641 INFO L87 Difference]: Start difference. First operand 613 states and 956 transitions. Second operand 7 states. [2019-10-02 12:16:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:52,721 INFO L93 Difference]: Finished difference Result 1147 states and 1813 transitions. [2019-10-02 12:16:52,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:16:52,722 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 12:16:52,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:52,726 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 12:16:52,727 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:16:52,729 INFO L640 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-02 12:16:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:16:52,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:16:52,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:16:52,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 922 transitions. [2019-10-02 12:16:52,749 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 922 transitions. Word has length 95 [2019-10-02 12:16:52,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:52,749 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 922 transitions. [2019-10-02 12:16:52,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:16:52,749 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 922 transitions. [2019-10-02 12:16:52,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:16:52,751 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:52,751 INFO L411 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] [2019-10-02 12:16:52,751 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:52,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:52,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2067893787, now seen corresponding path program 1 times [2019-10-02 12:16:52,752 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:52,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:52,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:52,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:52,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:52,861 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-02 12:16:52,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:52,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:52,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:52,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:52,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:52,863 INFO L87 Difference]: Start difference. First operand 592 states and 922 transitions. Second operand 6 states. [2019-10-02 12:16:52,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:52,956 INFO L93 Difference]: Finished difference Result 1126 states and 1779 transitions. [2019-10-02 12:16:52,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:16:52,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 12:16:52,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:52,961 INFO L225 Difference]: With dead ends: 1126 [2019-10-02 12:16:52,961 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:16:52,964 INFO L640 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-02 12:16:52,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:16:52,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:16:52,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:16:52,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 921 transitions. [2019-10-02 12:16:52,985 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 921 transitions. Word has length 96 [2019-10-02 12:16:52,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:52,985 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 921 transitions. [2019-10-02 12:16:52,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:16:52,985 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 921 transitions. [2019-10-02 12:16:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:16:52,987 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:52,987 INFO L411 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] [2019-10-02 12:16:52,987 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:52,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:52,988 INFO L82 PathProgramCache]: Analyzing trace with hash 845745390, now seen corresponding path program 1 times [2019-10-02 12:16:52,988 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:52,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:52,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:52,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:53,098 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-02 12:16:53,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:53,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:53,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:53,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:53,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:53,099 INFO L87 Difference]: Start difference. First operand 592 states and 921 transitions. Second operand 6 states. [2019-10-02 12:16:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:53,194 INFO L93 Difference]: Finished difference Result 1126 states and 1778 transitions. [2019-10-02 12:16:53,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:16:53,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 12:16:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:53,198 INFO L225 Difference]: With dead ends: 1126 [2019-10-02 12:16:53,199 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:16:53,201 INFO L640 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-02 12:16:53,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:16:53,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:16:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:16:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 920 transitions. [2019-10-02 12:16:53,223 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 920 transitions. Word has length 97 [2019-10-02 12:16:53,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:53,224 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 920 transitions. [2019-10-02 12:16:53,224 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:16:53,224 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 920 transitions. [2019-10-02 12:16:53,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:16:53,226 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:53,226 INFO L411 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] [2019-10-02 12:16:53,227 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:53,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:53,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1559535234, now seen corresponding path program 1 times [2019-10-02 12:16:53,227 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:53,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:53,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:53,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:53,378 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-02 12:16:53,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:53,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:53,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:53,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:53,380 INFO L87 Difference]: Start difference. First operand 592 states and 920 transitions. Second operand 4 states. [2019-10-02 12:16:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:53,439 INFO L93 Difference]: Finished difference Result 1126 states and 1777 transitions. [2019-10-02 12:16:53,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:16:53,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-10-02 12:16:53,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:53,444 INFO L225 Difference]: With dead ends: 1126 [2019-10-02 12:16:53,444 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:16:53,447 INFO L640 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-02 12:16:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:16:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:16:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:16:53,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 919 transitions. [2019-10-02 12:16:53,471 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 919 transitions. Word has length 98 [2019-10-02 12:16:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:53,473 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 919 transitions. [2019-10-02 12:16:53,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 919 transitions. [2019-10-02 12:16:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:16:53,474 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:53,474 INFO L411 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] [2019-10-02 12:16:53,475 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1575053952, now seen corresponding path program 1 times [2019-10-02 12:16:53,475 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:53,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:53,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:53,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:53,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:53,655 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-02 12:16:53,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:53,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:16:53,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:16:53,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:16:53,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:16:53,657 INFO L87 Difference]: Start difference. First operand 592 states and 919 transitions. Second operand 12 states. [2019-10-02 12:16:53,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:53,823 INFO L93 Difference]: Finished difference Result 1127 states and 1776 transitions. [2019-10-02 12:16:53,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:16:53,824 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-02 12:16:53,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:53,828 INFO L225 Difference]: With dead ends: 1127 [2019-10-02 12:16:53,828 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 12:16:53,831 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:16:53,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 12:16:53,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 12:16:53,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 12:16:53,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 918 transitions. [2019-10-02 12:16:53,850 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 918 transitions. Word has length 98 [2019-10-02 12:16:53,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:53,850 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 918 transitions. [2019-10-02 12:16:53,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:16:53,851 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 918 transitions. [2019-10-02 12:16:53,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:16:53,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:53,852 INFO L411 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] [2019-10-02 12:16:53,853 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:53,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:53,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1898679017, now seen corresponding path program 1 times [2019-10-02 12:16:53,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:53,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:53,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:53,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:53,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:53,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:54,002 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-02 12:16:54,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:54,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:54,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:54,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:54,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:54,004 INFO L87 Difference]: Start difference. First operand 592 states and 918 transitions. Second operand 6 states. [2019-10-02 12:16:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:57,482 INFO L93 Difference]: Finished difference Result 1754 states and 2806 transitions. [2019-10-02 12:16:57,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:16:57,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-02 12:16:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:57,491 INFO L225 Difference]: With dead ends: 1754 [2019-10-02 12:16:57,491 INFO L226 Difference]: Without dead ends: 1228 [2019-10-02 12:16:57,495 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:16:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2019-10-02 12:16:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1103. [2019-10-02 12:16:57,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1103 states. [2019-10-02 12:16:57,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1757 transitions. [2019-10-02 12:16:57,541 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1757 transitions. Word has length 99 [2019-10-02 12:16:57,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:57,542 INFO L475 AbstractCegarLoop]: Abstraction has 1103 states and 1757 transitions. [2019-10-02 12:16:57,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:16:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1757 transitions. [2019-10-02 12:16:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 12:16:57,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:57,547 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:57,547 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1662557516, now seen corresponding path program 1 times [2019-10-02 12:16:57,548 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:57,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:57,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:57,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:57,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:57,758 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:16:57,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:57,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:16:57,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:16:57,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:16:57,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:16:57,760 INFO L87 Difference]: Start difference. First operand 1103 states and 1757 transitions. Second operand 12 states. [2019-10-02 12:17:07,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:07,617 INFO L93 Difference]: Finished difference Result 3586 states and 5731 transitions. [2019-10-02 12:17:07,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:17:07,620 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 157 [2019-10-02 12:17:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:07,642 INFO L225 Difference]: With dead ends: 3586 [2019-10-02 12:17:07,642 INFO L226 Difference]: Without dead ends: 2549 [2019-10-02 12:17:07,648 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:17:07,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2019-10-02 12:17:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2491. [2019-10-02 12:17:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2491 states. [2019-10-02 12:17:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2491 states to 2491 states and 3938 transitions. [2019-10-02 12:17:07,758 INFO L78 Accepts]: Start accepts. Automaton has 2491 states and 3938 transitions. Word has length 157 [2019-10-02 12:17:07,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:07,758 INFO L475 AbstractCegarLoop]: Abstraction has 2491 states and 3938 transitions. [2019-10-02 12:17:07,758 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:17:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 2491 states and 3938 transitions. [2019-10-02 12:17:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:17:07,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:07,764 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:07,764 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:07,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1568685766, now seen corresponding path program 1 times [2019-10-02 12:17:07,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:07,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:07,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:07,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:07,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:07,898 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:17:07,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:17:07,898 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:17:08,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:08,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:08,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 3053 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:17:08,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:17:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:17:08,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:17:08,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:17:08,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:17:08,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:17:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:17:08,632 INFO L87 Difference]: Start difference. First operand 2491 states and 3938 transitions. Second operand 9 states. [2019-10-02 12:17:09,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:09,780 INFO L93 Difference]: Finished difference Result 4948 states and 8038 transitions. [2019-10-02 12:17:09,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:17:09,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 158 [2019-10-02 12:17:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:09,804 INFO L225 Difference]: With dead ends: 4948 [2019-10-02 12:17:09,804 INFO L226 Difference]: Without dead ends: 2523 [2019-10-02 12:17:09,817 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:17:09,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2523 states. [2019-10-02 12:17:09,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2523 to 2523. [2019-10-02 12:17:09,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-10-02 12:17:09,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 3968 transitions. [2019-10-02 12:17:09,967 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 3968 transitions. Word has length 158 [2019-10-02 12:17:09,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:09,968 INFO L475 AbstractCegarLoop]: Abstraction has 2523 states and 3968 transitions. [2019-10-02 12:17:09,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:17:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 3968 transitions. [2019-10-02 12:17:09,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 12:17:09,973 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:09,973 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:09,974 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:09,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:09,974 INFO L82 PathProgramCache]: Analyzing trace with hash -633101954, now seen corresponding path program 1 times [2019-10-02 12:17:09,974 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:09,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:09,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:09,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:10,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:17:10,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:17:10,123 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:17:10,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:10,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:10,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 3055 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:17:10,698 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:17:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:17:10,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:17:10,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:17:10,778 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:17:10,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:17:10,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:17:10,779 INFO L87 Difference]: Start difference. First operand 2523 states and 3968 transitions. Second operand 9 states. [2019-10-02 12:17:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:12,170 INFO L93 Difference]: Finished difference Result 5020 states and 8096 transitions. [2019-10-02 12:17:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:17:12,171 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 160 [2019-10-02 12:17:12,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:12,191 INFO L225 Difference]: With dead ends: 5020 [2019-10-02 12:17:12,191 INFO L226 Difference]: Without dead ends: 2563 [2019-10-02 12:17:12,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:17:12,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2563 states. [2019-10-02 12:17:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2563 to 2563. [2019-10-02 12:17:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2563 states. [2019-10-02 12:17:12,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2563 states to 2563 states and 4006 transitions. [2019-10-02 12:17:12,308 INFO L78 Accepts]: Start accepts. Automaton has 2563 states and 4006 transitions. Word has length 160 [2019-10-02 12:17:12,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:12,309 INFO L475 AbstractCegarLoop]: Abstraction has 2563 states and 4006 transitions. [2019-10-02 12:17:12,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:17:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 2563 states and 4006 transitions. [2019-10-02 12:17:12,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-02 12:17:12,315 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:12,315 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:12,315 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:12,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:12,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1116163654, now seen corresponding path program 1 times [2019-10-02 12:17:12,316 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:12,316 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:12,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:12,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:12,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:12,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:12,505 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:17:12,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:17:12,506 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:17:12,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:13,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:13,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 3057 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:17:13,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:17:13,359 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:17:13,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:17:13,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:17:13,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:17:13,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:17:13,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:17:13,380 INFO L87 Difference]: Start difference. First operand 2563 states and 4006 transitions. Second operand 9 states. [2019-10-02 12:17:14,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:14,894 INFO L93 Difference]: Finished difference Result 5108 states and 8170 transitions. [2019-10-02 12:17:14,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:17:14,894 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 162 [2019-10-02 12:17:14,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:14,912 INFO L225 Difference]: With dead ends: 5108 [2019-10-02 12:17:14,912 INFO L226 Difference]: Without dead ends: 2611 [2019-10-02 12:17:14,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 161 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:17:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2611 states. [2019-10-02 12:17:15,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2611 to 2611. [2019-10-02 12:17:15,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2611 states. [2019-10-02 12:17:15,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2611 states to 2611 states and 4052 transitions. [2019-10-02 12:17:15,047 INFO L78 Accepts]: Start accepts. Automaton has 2611 states and 4052 transitions. Word has length 162 [2019-10-02 12:17:15,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:15,050 INFO L475 AbstractCegarLoop]: Abstraction has 2611 states and 4052 transitions. [2019-10-02 12:17:15,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:17:15,050 INFO L276 IsEmpty]: Start isEmpty. Operand 2611 states and 4052 transitions. [2019-10-02 12:17:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:17:15,056 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:15,056 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:15,057 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:15,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:15,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1413320822, now seen corresponding path program 1 times [2019-10-02 12:17:15,057 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:15,058 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:15,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:15,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-02 12:17:15,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:17:15,234 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:17:15,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:15,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:15,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 3059 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:17:15,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:17:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:17:15,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:17:15,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:17:15,981 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:17:15,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:17:15,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:17:15,982 INFO L87 Difference]: Start difference. First operand 2611 states and 4052 transitions. Second operand 9 states. [2019-10-02 12:17:17,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:17,844 INFO L93 Difference]: Finished difference Result 5212 states and 8260 transitions. [2019-10-02 12:17:17,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:17:17,845 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-02 12:17:17,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:17,876 INFO L225 Difference]: With dead ends: 5212 [2019-10-02 12:17:17,876 INFO L226 Difference]: Without dead ends: 2667 [2019-10-02 12:17:17,891 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 163 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:17:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2019-10-02 12:17:18,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 2667. [2019-10-02 12:17:18,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2667 states. [2019-10-02 12:17:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2667 states to 2667 states and 4106 transitions. [2019-10-02 12:17:18,023 INFO L78 Accepts]: Start accepts. Automaton has 2667 states and 4106 transitions. Word has length 164 [2019-10-02 12:17:18,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:18,024 INFO L475 AbstractCegarLoop]: Abstraction has 2667 states and 4106 transitions. [2019-10-02 12:17:18,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:17:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2667 states and 4106 transitions. [2019-10-02 12:17:18,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:17:18,031 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:18,031 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:18,031 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:18,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:18,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2043600954, now seen corresponding path program 1 times [2019-10-02 12:17:18,032 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:18,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:18,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:18,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:18,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:18,272 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:17:18,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:17:18,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:17:18,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:18,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 3061 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:17:18,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:17:19,040 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:17:19,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:17:19,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:17:19,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:17:19,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:17:19,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:17:19,059 INFO L87 Difference]: Start difference. First operand 2667 states and 4106 transitions. Second operand 14 states. [2019-10-02 12:17:30,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:30,125 INFO L93 Difference]: Finished difference Result 8233 states and 12984 transitions. [2019-10-02 12:17:30,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:17:30,134 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 166 [2019-10-02 12:17:30,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:30,170 INFO L225 Difference]: With dead ends: 8233 [2019-10-02 12:17:30,171 INFO L226 Difference]: Without dead ends: 5632 [2019-10-02 12:17:30,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 180 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:17:30,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5632 states. [2019-10-02 12:17:30,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5632 to 5485. [2019-10-02 12:17:30,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5485 states. [2019-10-02 12:17:30,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5485 states to 5485 states and 8510 transitions. [2019-10-02 12:17:30,536 INFO L78 Accepts]: Start accepts. Automaton has 5485 states and 8510 transitions. Word has length 166 [2019-10-02 12:17:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:30,536 INFO L475 AbstractCegarLoop]: Abstraction has 5485 states and 8510 transitions. [2019-10-02 12:17:30,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:17:30,536 INFO L276 IsEmpty]: Start isEmpty. Operand 5485 states and 8510 transitions. [2019-10-02 12:17:30,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:17:30,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:30,549 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:30,549 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:30,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:30,550 INFO L82 PathProgramCache]: Analyzing trace with hash 382985480, now seen corresponding path program 1 times [2019-10-02 12:17:30,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:30,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:30,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:30,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:30,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:30,710 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:17:30,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:30,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:17:30,711 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:17:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:17:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:17:30,711 INFO L87 Difference]: Start difference. First operand 5485 states and 8510 transitions. Second operand 9 states. [2019-10-02 12:17:30,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:30,897 INFO L93 Difference]: Finished difference Result 8074 states and 12510 transitions. [2019-10-02 12:17:30,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:17:30,897 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-10-02 12:17:30,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:30,911 INFO L225 Difference]: With dead ends: 8074 [2019-10-02 12:17:30,912 INFO L226 Difference]: Without dead ends: 2643 [2019-10-02 12:17:30,925 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:17:30,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2643 states. [2019-10-02 12:17:31,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2643 to 2643. [2019-10-02 12:17:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2643 states. [2019-10-02 12:17:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4054 transitions. [2019-10-02 12:17:31,027 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4054 transitions. Word has length 175 [2019-10-02 12:17:31,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:31,027 INFO L475 AbstractCegarLoop]: Abstraction has 2643 states and 4054 transitions. [2019-10-02 12:17:31,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:17:31,028 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4054 transitions. [2019-10-02 12:17:31,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:17:31,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:31,034 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:31,034 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:31,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:31,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1309609907, now seen corresponding path program 1 times [2019-10-02 12:17:31,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:31,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:31,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:31,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:31,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:31,201 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:17:31,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:17:31,202 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:17:31,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:31,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 3096 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:17:31,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:17:31,845 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (7)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:17:31,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:17:31,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:17:31,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:17:31,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:17:31,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:17:31,864 INFO L87 Difference]: Start difference. First operand 2643 states and 4054 transitions. Second operand 14 states. [2019-10-02 12:17:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:37,359 INFO L93 Difference]: Finished difference Result 5563 states and 8682 transitions. [2019-10-02 12:17:37,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:17:37,360 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 178 [2019-10-02 12:17:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:37,375 INFO L225 Difference]: With dead ends: 5563 [2019-10-02 12:17:37,376 INFO L226 Difference]: Without dead ends: 2983 [2019-10-02 12:17:37,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 191 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:17:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2983 states. [2019-10-02 12:17:37,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2983 to 2709. [2019-10-02 12:17:37,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2709 states. [2019-10-02 12:17:37,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2709 states to 2709 states and 4138 transitions. [2019-10-02 12:17:37,584 INFO L78 Accepts]: Start accepts. Automaton has 2709 states and 4138 transitions. Word has length 178 [2019-10-02 12:17:37,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:37,585 INFO L475 AbstractCegarLoop]: Abstraction has 2709 states and 4138 transitions. [2019-10-02 12:17:37,585 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:17:37,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2709 states and 4138 transitions. [2019-10-02 12:17:37,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:17:37,596 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:37,596 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:37,596 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:37,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:37,597 INFO L82 PathProgramCache]: Analyzing trace with hash 485867888, now seen corresponding path program 1 times [2019-10-02 12:17:37,597 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:37,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:37,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:37,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:37,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:37,922 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 12:17:37,922 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:37,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:17:37,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:17:37,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:17:37,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:17:37,924 INFO L87 Difference]: Start difference. First operand 2709 states and 4138 transitions. Second operand 11 states. [2019-10-02 12:17:43,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:43,896 INFO L93 Difference]: Finished difference Result 5335 states and 8217 transitions. [2019-10-02 12:17:43,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:17:43,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 185 [2019-10-02 12:17:43,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:43,908 INFO L225 Difference]: With dead ends: 5335 [2019-10-02 12:17:43,908 INFO L226 Difference]: Without dead ends: 2697 [2019-10-02 12:17:43,916 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:17:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2019-10-02 12:17:44,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2697. [2019-10-02 12:17:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2697 states. [2019-10-02 12:17:44,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2697 states to 2697 states and 4114 transitions. [2019-10-02 12:17:44,028 INFO L78 Accepts]: Start accepts. Automaton has 2697 states and 4114 transitions. Word has length 185 [2019-10-02 12:17:44,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:44,028 INFO L475 AbstractCegarLoop]: Abstraction has 2697 states and 4114 transitions. [2019-10-02 12:17:44,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:17:44,029 INFO L276 IsEmpty]: Start isEmpty. Operand 2697 states and 4114 transitions. [2019-10-02 12:17:44,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:17:44,036 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:44,036 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:44,036 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:44,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:44,037 INFO L82 PathProgramCache]: Analyzing trace with hash 509669995, now seen corresponding path program 1 times [2019-10-02 12:17:44,037 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:44,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:44,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:44,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:44,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:44,193 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:17:44,194 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:44,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:17:44,195 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:17:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:17:44,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:17:44,196 INFO L87 Difference]: Start difference. First operand 2697 states and 4114 transitions. Second operand 9 states. [2019-10-02 12:17:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:49,520 INFO L93 Difference]: Finished difference Result 9149 states and 14195 transitions. [2019-10-02 12:17:49,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:17:49,521 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 187 [2019-10-02 12:17:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:49,551 INFO L225 Difference]: With dead ends: 9149 [2019-10-02 12:17:49,551 INFO L226 Difference]: Without dead ends: 6523 [2019-10-02 12:17:49,562 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:17:49,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6523 states. [2019-10-02 12:17:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6523 to 6362. [2019-10-02 12:17:49,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6362 states. [2019-10-02 12:17:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6362 states to 6362 states and 9773 transitions. [2019-10-02 12:17:49,917 INFO L78 Accepts]: Start accepts. Automaton has 6362 states and 9773 transitions. Word has length 187 [2019-10-02 12:17:49,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:49,918 INFO L475 AbstractCegarLoop]: Abstraction has 6362 states and 9773 transitions. [2019-10-02 12:17:49,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:17:49,918 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states and 9773 transitions. [2019-10-02 12:17:49,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:17:49,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:49,926 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:17:49,926 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:49,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:49,927 INFO L82 PathProgramCache]: Analyzing trace with hash 450733092, now seen corresponding path program 1 times [2019-10-02 12:17:49,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:49,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:49,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:49,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:49,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:17:50,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:50,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:17:50,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:17:50,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:17:50,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:17:50,075 INFO L87 Difference]: Start difference. First operand 6362 states and 9773 transitions. Second operand 7 states. [2019-10-02 12:17:50,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:50,298 INFO L93 Difference]: Finished difference Result 12887 states and 19859 transitions. [2019-10-02 12:17:50,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:17:50,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 192 [2019-10-02 12:17:50,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:50,329 INFO L225 Difference]: With dead ends: 12887 [2019-10-02 12:17:50,329 INFO L226 Difference]: Without dead ends: 6596 [2019-10-02 12:17:50,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:17:50,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6596 states. [2019-10-02 12:17:50,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6596 to 6488. [2019-10-02 12:17:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6488 states. [2019-10-02 12:17:50,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 9917 transitions. [2019-10-02 12:17:50,658 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 9917 transitions. Word has length 192 [2019-10-02 12:17:50,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:50,659 INFO L475 AbstractCegarLoop]: Abstraction has 6488 states and 9917 transitions. [2019-10-02 12:17:50,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:17:50,659 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 9917 transitions. [2019-10-02 12:17:50,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-02 12:17:50,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:50,665 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:17:50,665 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:50,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:50,666 INFO L82 PathProgramCache]: Analyzing trace with hash 366528332, now seen corresponding path program 1 times [2019-10-02 12:17:50,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:50,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:50,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:17:50,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:50,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:17:50,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:17:50,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:17:50,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:17:50,868 INFO L87 Difference]: Start difference. First operand 6488 states and 9917 transitions. Second operand 8 states. [2019-10-02 12:17:55,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:55,075 INFO L93 Difference]: Finished difference Result 19755 states and 30724 transitions. [2019-10-02 12:17:55,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:17:55,075 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-10-02 12:17:55,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:55,153 INFO L225 Difference]: With dead ends: 19755 [2019-10-02 12:17:55,154 INFO L226 Difference]: Without dead ends: 13322 [2019-10-02 12:17:55,178 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:17:55,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13322 states. [2019-10-02 12:17:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13322 to 13286. [2019-10-02 12:17:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13286 states. [2019-10-02 12:17:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13286 states to 13286 states and 20283 transitions. [2019-10-02 12:17:56,466 INFO L78 Accepts]: Start accepts. Automaton has 13286 states and 20283 transitions. Word has length 196 [2019-10-02 12:17:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:56,466 INFO L475 AbstractCegarLoop]: Abstraction has 13286 states and 20283 transitions. [2019-10-02 12:17:56,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:17:56,466 INFO L276 IsEmpty]: Start isEmpty. Operand 13286 states and 20283 transitions. [2019-10-02 12:17:56,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:17:56,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:56,473 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:17:56,473 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:56,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash 526979047, now seen corresponding path program 1 times [2019-10-02 12:17:56,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:56,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:56,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:56,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:56,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 12:17:56,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:56,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:17:56,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:17:56,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:17:56,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:17:56,617 INFO L87 Difference]: Start difference. First operand 13286 states and 20283 transitions. Second operand 9 states. [2019-10-02 12:17:57,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:57,160 INFO L93 Difference]: Finished difference Result 27279 states and 42854 transitions. [2019-10-02 12:17:57,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:17:57,160 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-10-02 12:17:57,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:17:57,220 INFO L225 Difference]: With dead ends: 27279 [2019-10-02 12:17:57,220 INFO L226 Difference]: Without dead ends: 13286 [2019-10-02 12:17:57,259 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:17:57,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13286 states. [2019-10-02 12:17:58,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13286 to 13286. [2019-10-02 12:17:58,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13286 states. [2019-10-02 12:17:58,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13286 states to 13286 states and 20023 transitions. [2019-10-02 12:17:58,249 INFO L78 Accepts]: Start accepts. Automaton has 13286 states and 20023 transitions. Word has length 199 [2019-10-02 12:17:58,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:58,250 INFO L475 AbstractCegarLoop]: Abstraction has 13286 states and 20023 transitions. [2019-10-02 12:17:58,250 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:17:58,250 INFO L276 IsEmpty]: Start isEmpty. Operand 13286 states and 20023 transitions. [2019-10-02 12:17:58,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 12:17:58,258 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:58,258 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:17:58,258 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:58,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:58,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1810688535, now seen corresponding path program 1 times [2019-10-02 12:17:58,259 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:58,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:58,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:58,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:58,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:58,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:17:58,424 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:58,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:17:58,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:17:58,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:17:58,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:17:58,425 INFO L87 Difference]: Start difference. First operand 13286 states and 20023 transitions. Second operand 7 states. [2019-10-02 12:18:02,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:02,773 INFO L93 Difference]: Finished difference Result 26564 states and 40467 transitions. [2019-10-02 12:18:02,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:18:02,773 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 204 [2019-10-02 12:18:02,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:02,823 INFO L225 Difference]: With dead ends: 26564 [2019-10-02 12:18:02,824 INFO L226 Difference]: Without dead ends: 14361 [2019-10-02 12:18:02,845 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:18:02,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14361 states. [2019-10-02 12:18:03,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14361 to 13994. [2019-10-02 12:18:03,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13994 states. [2019-10-02 12:18:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13994 states to 13994 states and 20983 transitions. [2019-10-02 12:18:03,404 INFO L78 Accepts]: Start accepts. Automaton has 13994 states and 20983 transitions. Word has length 204 [2019-10-02 12:18:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:03,405 INFO L475 AbstractCegarLoop]: Abstraction has 13994 states and 20983 transitions. [2019-10-02 12:18:03,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:18:03,405 INFO L276 IsEmpty]: Start isEmpty. Operand 13994 states and 20983 transitions. [2019-10-02 12:18:03,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 12:18:03,410 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:03,410 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:18:03,411 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:03,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:03,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2038770583, now seen corresponding path program 1 times [2019-10-02 12:18:03,411 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:03,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:03,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:03,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:03,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 12:18:03,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:03,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:18:03,558 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:18:03,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:18:03,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:18:03,558 INFO L87 Difference]: Start difference. First operand 13994 states and 20983 transitions. Second operand 9 states. [2019-10-02 12:18:04,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:04,411 INFO L93 Difference]: Finished difference Result 14920 states and 22220 transitions. [2019-10-02 12:18:04,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:18:04,412 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 209 [2019-10-02 12:18:04,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:04,465 INFO L225 Difference]: With dead ends: 14920 [2019-10-02 12:18:04,465 INFO L226 Difference]: Without dead ends: 14903 [2019-10-02 12:18:04,475 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:18:04,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14903 states. [2019-10-02 12:18:05,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14903 to 14699. [2019-10-02 12:18:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14699 states. [2019-10-02 12:18:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14699 states to 14699 states and 21911 transitions. [2019-10-02 12:18:05,755 INFO L78 Accepts]: Start accepts. Automaton has 14699 states and 21911 transitions. Word has length 209 [2019-10-02 12:18:05,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:05,756 INFO L475 AbstractCegarLoop]: Abstraction has 14699 states and 21911 transitions. [2019-10-02 12:18:05,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:18:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 14699 states and 21911 transitions. [2019-10-02 12:18:05,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:18:05,763 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:05,763 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:18:05,763 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:05,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:05,764 INFO L82 PathProgramCache]: Analyzing trace with hash 65746402, now seen corresponding path program 1 times [2019-10-02 12:18:05,764 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:05,764 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:05,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:05,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:05,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 12:18:05,928 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:05,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:18:05,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:18:05,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:18:05,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:18:05,932 INFO L87 Difference]: Start difference. First operand 14699 states and 21911 transitions. Second operand 9 states. [2019-10-02 12:18:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:09,397 INFO L93 Difference]: Finished difference Result 29381 states and 43911 transitions. [2019-10-02 12:18:09,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:18:09,397 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 227 [2019-10-02 12:18:09,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:09,448 INFO L225 Difference]: With dead ends: 29381 [2019-10-02 12:18:09,448 INFO L226 Difference]: Without dead ends: 14761 [2019-10-02 12:18:09,474 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 18 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-02 12:18:09,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14761 states. [2019-10-02 12:18:10,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14761 to 14699. [2019-10-02 12:18:10,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14699 states. [2019-10-02 12:18:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14699 states to 14699 states and 21876 transitions. [2019-10-02 12:18:10,205 INFO L78 Accepts]: Start accepts. Automaton has 14699 states and 21876 transitions. Word has length 227 [2019-10-02 12:18:10,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:10,206 INFO L475 AbstractCegarLoop]: Abstraction has 14699 states and 21876 transitions. [2019-10-02 12:18:10,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:18:10,206 INFO L276 IsEmpty]: Start isEmpty. Operand 14699 states and 21876 transitions. [2019-10-02 12:18:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 12:18:10,210 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:10,210 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:18:10,210 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:10,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash 962656854, now seen corresponding path program 1 times [2019-10-02 12:18:10,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:10,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:10,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:10,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:10,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:10,352 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 12:18:10,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:10,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:18:10,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:18:10,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:18:10,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:18:10,354 INFO L87 Difference]: Start difference. First operand 14699 states and 21876 transitions. Second operand 6 states. [2019-10-02 12:18:14,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:14,548 INFO L93 Difference]: Finished difference Result 37988 states and 58073 transitions. [2019-10-02 12:18:14,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:18:14,548 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 228 [2019-10-02 12:18:14,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:14,627 INFO L225 Difference]: With dead ends: 37988 [2019-10-02 12:18:14,627 INFO L226 Difference]: Without dead ends: 23368 [2019-10-02 12:18:14,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:18:14,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23368 states. [2019-10-02 12:18:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23368 to 22247. [2019-10-02 12:18:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22247 states. [2019-10-02 12:18:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22247 states to 22247 states and 33110 transitions. [2019-10-02 12:18:15,536 INFO L78 Accepts]: Start accepts. Automaton has 22247 states and 33110 transitions. Word has length 228 [2019-10-02 12:18:15,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:15,536 INFO L475 AbstractCegarLoop]: Abstraction has 22247 states and 33110 transitions. [2019-10-02 12:18:15,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:18:15,536 INFO L276 IsEmpty]: Start isEmpty. Operand 22247 states and 33110 transitions. [2019-10-02 12:18:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 12:18:15,541 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:15,541 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:18:15,542 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:15,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:15,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1242414141, now seen corresponding path program 1 times [2019-10-02 12:18:15,542 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:15,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:15,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:15,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:15,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:15,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:15,697 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:18:15,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:15,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:18:15,698 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:18:15,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:18:15,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:18:15,699 INFO L87 Difference]: Start difference. First operand 22247 states and 33110 transitions. Second operand 4 states. [2019-10-02 12:18:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:18,703 INFO L93 Difference]: Finished difference Result 61984 states and 96441 transitions. [2019-10-02 12:18:18,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:18:18,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 236 [2019-10-02 12:18:18,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:18,888 INFO L225 Difference]: With dead ends: 61984 [2019-10-02 12:18:18,888 INFO L226 Difference]: Without dead ends: 39800 [2019-10-02 12:18:18,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-02 12:18:18,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39800 states. [2019-10-02 12:18:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39800 to 39182. [2019-10-02 12:18:20,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39182 states. [2019-10-02 12:18:20,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39182 states to 39182 states and 60148 transitions. [2019-10-02 12:18:20,639 INFO L78 Accepts]: Start accepts. Automaton has 39182 states and 60148 transitions. Word has length 236 [2019-10-02 12:18:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:20,640 INFO L475 AbstractCegarLoop]: Abstraction has 39182 states and 60148 transitions. [2019-10-02 12:18:20,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:18:20,640 INFO L276 IsEmpty]: Start isEmpty. Operand 39182 states and 60148 transitions. [2019-10-02 12:18:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 12:18:20,648 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:20,649 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:18:20,649 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:20,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:20,649 INFO L82 PathProgramCache]: Analyzing trace with hash 138188634, now seen corresponding path program 1 times [2019-10-02 12:18:20,649 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:20,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:20,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:20,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:20,800 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:18:20,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:20,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:18:20,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:18:20,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:18:20,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:18:20,802 INFO L87 Difference]: Start difference. First operand 39182 states and 60148 transitions. Second operand 4 states. [2019-10-02 12:18:25,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:25,621 INFO L93 Difference]: Finished difference Result 115553 states and 193346 transitions. [2019-10-02 12:18:25,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:18:25,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-02 12:18:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:26,005 INFO L225 Difference]: With dead ends: 115553 [2019-10-02 12:18:26,005 INFO L226 Difference]: Without dead ends: 76434 [2019-10-02 12:18:26,114 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-02 12:18:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76434 states. [2019-10-02 12:18:31,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76434 to 75121. [2019-10-02 12:18:31,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75121 states. [2019-10-02 12:18:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75121 states to 75121 states and 122888 transitions. [2019-10-02 12:18:31,745 INFO L78 Accepts]: Start accepts. Automaton has 75121 states and 122888 transitions. Word has length 237 [2019-10-02 12:18:31,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:31,745 INFO L475 AbstractCegarLoop]: Abstraction has 75121 states and 122888 transitions. [2019-10-02 12:18:31,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:18:31,746 INFO L276 IsEmpty]: Start isEmpty. Operand 75121 states and 122888 transitions. [2019-10-02 12:18:32,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 12:18:32,387 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:32,387 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:18:32,387 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:32,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:32,387 INFO L82 PathProgramCache]: Analyzing trace with hash -12794395, now seen corresponding path program 1 times [2019-10-02 12:18:32,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:32,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:32,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:32,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:32,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:32,523 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:18:32,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:32,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:18:32,524 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:18:32,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:18:32,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:18:32,524 INFO L87 Difference]: Start difference. First operand 75121 states and 122888 transitions. Second operand 4 states. [2019-10-02 12:18:42,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:18:42,111 INFO L93 Difference]: Finished difference Result 230602 states and 440044 transitions. [2019-10-02 12:18:42,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:18:42,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-10-02 12:18:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:42,951 INFO L225 Difference]: With dead ends: 230602 [2019-10-02 12:18:42,951 INFO L226 Difference]: Without dead ends: 155544 [2019-10-02 12:18:43,183 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-02 12:18:43,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155544 states. [2019-10-02 12:18:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155544 to 152634. [2019-10-02 12:18:53,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152634 states. [2019-10-02 12:18:55,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152634 states to 152634 states and 279745 transitions. [2019-10-02 12:18:55,574 INFO L78 Accepts]: Start accepts. Automaton has 152634 states and 279745 transitions. Word has length 238 [2019-10-02 12:18:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:18:55,575 INFO L475 AbstractCegarLoop]: Abstraction has 152634 states and 279745 transitions. [2019-10-02 12:18:55,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:18:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 152634 states and 279745 transitions. [2019-10-02 12:18:55,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 12:18:55,588 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:18:55,589 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:18:55,589 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:18:55,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:18:55,589 INFO L82 PathProgramCache]: Analyzing trace with hash -398297092, now seen corresponding path program 1 times [2019-10-02 12:18:55,590 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:18:55,590 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:18:55,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:55,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:18:55,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:18:55,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:18:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:18:55,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:18:55,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:18:55,725 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:18:55,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:18:55,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:18:55,725 INFO L87 Difference]: Start difference. First operand 152634 states and 279745 transitions. Second operand 4 states. [2019-10-02 12:19:23,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:19:23,404 INFO L93 Difference]: Finished difference Result 482601 states and 1143229 transitions. [2019-10-02 12:19:23,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:19:23,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 239 [2019-10-02 12:19:23,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:19:25,654 INFO L225 Difference]: With dead ends: 482601 [2019-10-02 12:19:25,654 INFO L226 Difference]: Without dead ends: 330030 [2019-10-02 12:19:26,197 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-02 12:19:26,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330030 states. [2019-10-02 12:20:06,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330030 to 323303. [2019-10-02 12:20:06,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323303 states. [2019-10-02 12:20:19,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323303 states to 323303 states and 714634 transitions. [2019-10-02 12:20:19,325 INFO L78 Accepts]: Start accepts. Automaton has 323303 states and 714634 transitions. Word has length 239 [2019-10-02 12:20:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:20:19,326 INFO L475 AbstractCegarLoop]: Abstraction has 323303 states and 714634 transitions. [2019-10-02 12:20:19,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:20:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 323303 states and 714634 transitions. [2019-10-02 12:20:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:20:19,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:20:19,349 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 12:20:19,349 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:20:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:20:19,350 INFO L82 PathProgramCache]: Analyzing trace with hash 536025095, now seen corresponding path program 1 times [2019-10-02 12:20:19,350 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:20:19,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:20:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:19,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:20:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:20:19,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:20:19,508 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:20:19,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:20:19,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:20:19,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:20:19,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:20:19,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:20:19,510 INFO L87 Difference]: Start difference. First operand 323303 states and 714634 transitions. Second operand 4 states. [2019-10-02 12:22:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:22:08,168 INFO L93 Difference]: Finished difference Result 1047803 states and 3433019 transitions. [2019-10-02 12:22:08,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:22:08,168 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-10-02 12:22:08,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:22:30,748 INFO L225 Difference]: With dead ends: 1047803 [2019-10-02 12:22:30,748 INFO L226 Difference]: Without dead ends: 724551 [2019-10-02 12:22:32,655 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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-02 12:22:33,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724551 states.