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_spec9_product31.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:39:09,580 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:39:09,582 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:39:09,594 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:39:09,595 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:39:09,596 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:39:09,597 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:39:09,599 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:39:09,600 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:39:09,601 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:39:09,602 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:39:09,603 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:39:09,604 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:39:09,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:39:09,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:39:09,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:39:09,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:39:09,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:39:09,610 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:39:09,612 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:39:09,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:39:09,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:39:09,617 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:39:09,617 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:39:09,620 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:39:09,620 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:39:09,620 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:39:09,621 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:39:09,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:39:09,623 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:39:09,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:39:09,624 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:39:09,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:39:09,625 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:39:09,626 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:39:09,626 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:39:09,627 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:39:09,627 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:39:09,627 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:39:09,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:39:09,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:39:09,630 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:39:09,644 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:39:09,645 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:39:09,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:39:09,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:39:09,646 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:39:09,647 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:39:09,647 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:39:09,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:39:09,647 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:39:09,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:39:09,648 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:39:09,648 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:39:09,648 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:39:09,648 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:39:09,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:39:09,649 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:39:09,649 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:39:09,649 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:39:09,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:39:09,650 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:39:09,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:39:09,650 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:39:09,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:39:09,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:39:09,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:39:09,651 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:39:09,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:39:09,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:39:09,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:39:09,682 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:39:09,700 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:39:09,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:39:09,705 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:39:09,706 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:39:09,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product31.cil.c [2019-10-02 12:39:09,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f3f9da8/e3bf486e26b74e9bab99e0d3deefb054/FLAGffc1737cd [2019-10-02 12:39:10,399 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:39:10,400 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product31.cil.c [2019-10-02 12:39:10,436 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f3f9da8/e3bf486e26b74e9bab99e0d3deefb054/FLAGffc1737cd [2019-10-02 12:39:10,539 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f3f9da8/e3bf486e26b74e9bab99e0d3deefb054 [2019-10-02 12:39:10,553 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:39:10,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:39:10,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:39:10,558 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:39:10,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:39:10,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:39:10" (1/1) ... [2019-10-02 12:39:10,565 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@750b091d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:10, skipping insertion in model container [2019-10-02 12:39:10,565 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:39:10" (1/1) ... [2019-10-02 12:39:10,572 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:39:10,661 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:39:11,453 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:39:11,475 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:39:11,632 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:39:11,711 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:39:11,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11 WrapperNode [2019-10-02 12:39:11,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:39:11,713 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:39:11,714 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:39:11,714 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:39:11,729 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (1/1) ... [2019-10-02 12:39:11,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (1/1) ... [2019-10-02 12:39:11,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (1/1) ... [2019-10-02 12:39:11,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (1/1) ... [2019-10-02 12:39:11,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (1/1) ... [2019-10-02 12:39:11,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (1/1) ... [2019-10-02 12:39:11,896 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (1/1) ... [2019-10-02 12:39:11,922 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:39:11,923 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:39:11,923 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:39:11,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:39:11,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:39:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:39:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:39:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:39:12,001 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:39:12,002 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:39:12,003 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:39:12,003 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:39:12,003 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:39:12,003 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:39:12,003 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:39:12,004 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:39:12,004 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:39:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:39:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:39:12,006 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:39:12,006 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:39:12,008 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:39:12,009 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:39:12,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:39:12,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:39:12,009 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:39:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:39:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:39:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:39:12,010 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:39:12,011 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:39:12,011 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:39:12,011 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:39:12,011 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-10-02 12:39:12,011 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:39:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:39:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:39:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:39:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:39:12,012 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:39:12,013 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:39:12,013 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:39:12,013 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:39:12,013 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:39:12,013 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:39:12,013 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:39:12,014 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:39:12,014 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:39:12,014 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:39:12,015 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:39:12,015 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:39:12,015 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:39:12,015 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:39:12,016 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:39:12,016 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:39:12,016 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:39:12,016 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:39:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:39:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:39:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:39:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:39:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:39:12,017 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:39:12,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:39:12,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:39:12,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:39:12,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:39:12,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:39:12,019 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:39:12,019 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:39:12,019 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:39:12,020 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:39:12,020 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:39:12,020 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:39:12,020 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:39:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:39:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:39:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:39:12,021 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:39:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:39:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:39:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:39:12,022 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:39:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:39:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:39:12,023 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:39:12,023 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:39:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:39:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:39:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:39:12,024 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:39:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:39:12,025 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:39:12,026 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:39:12,026 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:39:12,026 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:39:12,027 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:39:12,028 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:39:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:39:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:39:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:39:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-02 12:39:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-02 12:39:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-02 12:39:12,029 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-02 12:39:12,030 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:39:12,030 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:39:12,030 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:39:12,030 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:39:12,030 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:39:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:39:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:39:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:39:12,031 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:39:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-10-02 12:39:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:39:12,032 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:39:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:39:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:39:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:39:12,033 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-02 12:39:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:39:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:39:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:39:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-02 12:39:12,034 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:39:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:39:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:39:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:39:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:39:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:39:12,035 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:39:12,036 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:39:12,039 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:39:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:39:12,040 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:39:12,041 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:39:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:39:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:39:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:39:12,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:39:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:39:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:39:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:39:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:39:12,048 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:39:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:39:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:39:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:39:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:39:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:39:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:39:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:39:12,049 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:39:12,050 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:39:12,050 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:39:12,050 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:39:12,050 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:39:12,050 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:39:12,050 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:39:12,050 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:39:12,050 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:39:12,051 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:39:12,051 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:39:12,051 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:39:12,051 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:39:12,051 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:39:12,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:39:12,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:39:12,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:39:14,557 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:39:14,558 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:39:14,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:39:14 BoogieIcfgContainer [2019-10-02 12:39:14,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:39:14,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:39:14,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:39:14,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:39:14,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:39:10" (1/3) ... [2019-10-02 12:39:14,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6266743a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:39:14, skipping insertion in model container [2019-10-02 12:39:14,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:39:11" (2/3) ... [2019-10-02 12:39:14,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6266743a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:39:14, skipping insertion in model container [2019-10-02 12:39:14,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:39:14" (3/3) ... [2019-10-02 12:39:14,568 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product31.cil.c [2019-10-02 12:39:14,578 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:39:14,590 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:39:14,606 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:39:14,651 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:39:14,652 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:39:14,652 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:39:14,652 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:39:14,652 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:39:14,652 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:39:14,652 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:39:14,652 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:39:14,653 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:39:14,689 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states. [2019-10-02 12:39:14,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:39:14,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:14,717 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] [2019-10-02 12:39:14,720 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:14,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:14,726 INFO L82 PathProgramCache]: Analyzing trace with hash -817980403, now seen corresponding path program 1 times [2019-10-02 12:39:14,728 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:14,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:14,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:14,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:15,417 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:39:15,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:15,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:15,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:15,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:15,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:15,444 INFO L87 Difference]: Start difference. First operand 808 states. Second operand 4 states. [2019-10-02 12:39:15,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:15,673 INFO L93 Difference]: Finished difference Result 1279 states and 2045 transitions. [2019-10-02 12:39:15,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:15,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-02 12:39:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:15,700 INFO L225 Difference]: With dead ends: 1279 [2019-10-02 12:39:15,701 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:39:15,713 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:39:15,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:39:15,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:39:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:39:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1024 transitions. [2019-10-02 12:39:15,815 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1024 transitions. Word has length 135 [2019-10-02 12:39:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:15,815 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1024 transitions. [2019-10-02 12:39:15,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:15,816 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1024 transitions. [2019-10-02 12:39:15,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:39:15,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:15,825 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] [2019-10-02 12:39:15,826 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:15,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:15,826 INFO L82 PathProgramCache]: Analyzing trace with hash 40844142, now seen corresponding path program 1 times [2019-10-02 12:39:15,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:15,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:15,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:15,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:15,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:16,094 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:39:16,094 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:16,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:16,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:16,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:16,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:16,100 INFO L87 Difference]: Start difference. First operand 648 states and 1024 transitions. Second operand 4 states. [2019-10-02 12:39:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:16,186 INFO L93 Difference]: Finished difference Result 1259 states and 2006 transitions. [2019-10-02 12:39:16,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:16,187 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-02 12:39:16,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:16,193 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:39:16,194 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:39:16,197 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:39:16,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:39:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:39:16,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:39:16,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1023 transitions. [2019-10-02 12:39:16,256 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1023 transitions. Word has length 138 [2019-10-02 12:39:16,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:16,257 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1023 transitions. [2019-10-02 12:39:16,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:16,257 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1023 transitions. [2019-10-02 12:39:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:39:16,268 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:16,269 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] [2019-10-02 12:39:16,269 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:16,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:16,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2063727196, now seen corresponding path program 1 times [2019-10-02 12:39:16,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:16,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:16,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:16,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:16,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:16,533 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:39:16,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:16,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:16,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:16,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:16,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:16,536 INFO L87 Difference]: Start difference. First operand 648 states and 1023 transitions. Second operand 4 states. [2019-10-02 12:39:16,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:16,606 INFO L93 Difference]: Finished difference Result 1259 states and 2005 transitions. [2019-10-02 12:39:16,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:16,607 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-02 12:39:16,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:16,617 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:39:16,617 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:39:16,621 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:39:16,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:39:16,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:39:16,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:39:16,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1022 transitions. [2019-10-02 12:39:16,685 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1022 transitions. Word has length 139 [2019-10-02 12:39:16,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:16,685 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1022 transitions. [2019-10-02 12:39:16,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:16,686 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1022 transitions. [2019-10-02 12:39:16,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:39:16,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:16,692 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] [2019-10-02 12:39:16,692 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:16,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:16,693 INFO L82 PathProgramCache]: Analyzing trace with hash -897970774, now seen corresponding path program 1 times [2019-10-02 12:39:16,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:16,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:16,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:16,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:16,809 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:39:16,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:16,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:16,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:16,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:16,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:16,811 INFO L87 Difference]: Start difference. First operand 648 states and 1022 transitions. Second operand 4 states. [2019-10-02 12:39:16,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:16,874 INFO L93 Difference]: Finished difference Result 1259 states and 2004 transitions. [2019-10-02 12:39:16,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:16,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-02 12:39:16,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:16,880 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:39:16,880 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:39:16,884 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:39:16,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:39:16,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:39:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:39:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1021 transitions. [2019-10-02 12:39:16,912 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1021 transitions. Word has length 140 [2019-10-02 12:39:16,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:16,912 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1021 transitions. [2019-10-02 12:39:16,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:16,913 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1021 transitions. [2019-10-02 12:39:16,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:39:16,918 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:16,919 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] [2019-10-02 12:39:16,919 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:16,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:16,919 INFO L82 PathProgramCache]: Analyzing trace with hash 532109464, now seen corresponding path program 1 times [2019-10-02 12:39:16,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:16,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:16,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:16,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:16,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:17,036 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:39:17,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:17,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:17,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:17,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:17,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:17,038 INFO L87 Difference]: Start difference. First operand 648 states and 1021 transitions. Second operand 4 states. [2019-10-02 12:39:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:17,115 INFO L93 Difference]: Finished difference Result 1259 states and 2003 transitions. [2019-10-02 12:39:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:17,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-02 12:39:17,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:17,127 INFO L225 Difference]: With dead ends: 1259 [2019-10-02 12:39:17,127 INFO L226 Difference]: Without dead ends: 648 [2019-10-02 12:39:17,131 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:39:17,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-10-02 12:39:17,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 648. [2019-10-02 12:39:17,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:39:17,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1020 transitions. [2019-10-02 12:39:17,162 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1020 transitions. Word has length 141 [2019-10-02 12:39:17,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:17,163 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1020 transitions. [2019-10-02 12:39:17,163 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:17,164 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1020 transitions. [2019-10-02 12:39:17,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:39:17,170 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:17,171 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] [2019-10-02 12:39:17,172 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:17,173 INFO L82 PathProgramCache]: Analyzing trace with hash 668360678, now seen corresponding path program 1 times [2019-10-02 12:39:17,173 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:17,173 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:17,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:17,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:17,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:17,508 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:39:17,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:17,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:39:17,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:39:17,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:39:17,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:39:17,514 INFO L87 Difference]: Start difference. First operand 648 states and 1020 transitions. Second operand 10 states. [2019-10-02 12:39:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:17,891 INFO L93 Difference]: Finished difference Result 1217 states and 1923 transitions. [2019-10-02 12:39:17,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:39:17,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-10-02 12:39:17,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:17,898 INFO L225 Difference]: With dead ends: 1217 [2019-10-02 12:39:17,899 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:39:17,903 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:39:17,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:39:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 655. [2019-10-02 12:39:17,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-10-02 12:39:17,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1029 transitions. [2019-10-02 12:39:17,947 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1029 transitions. Word has length 142 [2019-10-02 12:39:17,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:17,948 INFO L475 AbstractCegarLoop]: Abstraction has 655 states and 1029 transitions. [2019-10-02 12:39:17,948 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:39:17,948 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1029 transitions. [2019-10-02 12:39:17,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 12:39:17,957 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:17,957 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] [2019-10-02 12:39:17,958 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:17,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1790763771, now seen corresponding path program 1 times [2019-10-02 12:39:17,958 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:17,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:17,963 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:17,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:17,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:18,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:18,087 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:39:18,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:18,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:18,088 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:18,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:18,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:18,089 INFO L87 Difference]: Start difference. First operand 655 states and 1029 transitions. Second operand 4 states. [2019-10-02 12:39:18,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:18,140 INFO L93 Difference]: Finished difference Result 1265 states and 2009 transitions. [2019-10-02 12:39:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:18,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-02 12:39:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:18,148 INFO L225 Difference]: With dead ends: 1265 [2019-10-02 12:39:18,149 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:39:18,152 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:39:18,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:39:18,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:39:18,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:39:18,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1006 transitions. [2019-10-02 12:39:18,176 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1006 transitions. Word has length 142 [2019-10-02 12:39:18,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:18,177 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1006 transitions. [2019-10-02 12:39:18,177 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:18,177 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1006 transitions. [2019-10-02 12:39:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 12:39:18,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:18,182 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] [2019-10-02 12:39:18,182 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:18,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash -973748208, now seen corresponding path program 1 times [2019-10-02 12:39:18,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:18,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:18,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:18,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:18,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:18,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:18,350 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:39:18,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:18,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:18,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:18,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:18,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:18,352 INFO L87 Difference]: Start difference. First operand 642 states and 1006 transitions. Second operand 6 states. [2019-10-02 12:39:18,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:18,644 INFO L93 Difference]: Finished difference Result 1205 states and 1901 transitions. [2019-10-02 12:39:18,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:18,645 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-02 12:39:18,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:18,650 INFO L225 Difference]: With dead ends: 1205 [2019-10-02 12:39:18,651 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:39:18,654 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:39:18,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:39:18,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:39:18,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:39:18,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1002 transitions. [2019-10-02 12:39:18,675 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1002 transitions. Word has length 143 [2019-10-02 12:39:18,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:18,676 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1002 transitions. [2019-10-02 12:39:18,676 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1002 transitions. [2019-10-02 12:39:18,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:39:18,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:18,681 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] [2019-10-02 12:39:18,681 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:18,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:18,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1310296887, now seen corresponding path program 1 times [2019-10-02 12:39:18,682 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:18,682 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:18,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:18,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:18,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:18,813 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:39:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:18,815 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:18,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:18,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:18,815 INFO L87 Difference]: Start difference. First operand 642 states and 1002 transitions. Second operand 6 states. [2019-10-02 12:39:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:19,046 INFO L93 Difference]: Finished difference Result 1205 states and 1897 transitions. [2019-10-02 12:39:19,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:19,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-02 12:39:19,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:19,052 INFO L225 Difference]: With dead ends: 1205 [2019-10-02 12:39:19,053 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:39:19,056 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:39:19,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:39:19,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:39:19,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:39:19,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 998 transitions. [2019-10-02 12:39:19,081 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 998 transitions. Word has length 144 [2019-10-02 12:39:19,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:19,082 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 998 transitions. [2019-10-02 12:39:19,082 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:19,082 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 998 transitions. [2019-10-02 12:39:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:39:19,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:19,087 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] [2019-10-02 12:39:19,088 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:19,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash -575769099, now seen corresponding path program 1 times [2019-10-02 12:39:19,088 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:19,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:19,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:19,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:19,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:19,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:19,233 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:39:19,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:19,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:19,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:19,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:19,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:19,235 INFO L87 Difference]: Start difference. First operand 642 states and 998 transitions. Second operand 6 states. [2019-10-02 12:39:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:19,410 INFO L93 Difference]: Finished difference Result 1205 states and 1893 transitions. [2019-10-02 12:39:19,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:19,411 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-02 12:39:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:19,416 INFO L225 Difference]: With dead ends: 1205 [2019-10-02 12:39:19,417 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:39:19,420 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:39:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:39:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:39:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:39:19,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 994 transitions. [2019-10-02 12:39:19,441 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 994 transitions. Word has length 145 [2019-10-02 12:39:19,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:19,442 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 994 transitions. [2019-10-02 12:39:19,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:19,442 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 994 transitions. [2019-10-02 12:39:19,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-02 12:39:19,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:19,447 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] [2019-10-02 12:39:19,448 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:19,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:19,448 INFO L82 PathProgramCache]: Analyzing trace with hash -839167371, now seen corresponding path program 1 times [2019-10-02 12:39:19,448 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:19,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:19,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:19,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:19,588 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:39:19,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:19,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:39:19,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:19,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:19,590 INFO L87 Difference]: Start difference. First operand 642 states and 994 transitions. Second operand 7 states. [2019-10-02 12:39:19,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:19,733 INFO L93 Difference]: Finished difference Result 1205 states and 1889 transitions. [2019-10-02 12:39:19,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:39:19,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-02 12:39:19,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:19,738 INFO L225 Difference]: With dead ends: 1205 [2019-10-02 12:39:19,739 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:39:19,742 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:39:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:39:19,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:39:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:39:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 960 transitions. [2019-10-02 12:39:19,762 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 960 transitions. Word has length 145 [2019-10-02 12:39:19,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:19,762 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 960 transitions. [2019-10-02 12:39:19,762 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 960 transitions. [2019-10-02 12:39:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 12:39:19,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:19,767 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] [2019-10-02 12:39:19,767 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:19,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:19,768 INFO L82 PathProgramCache]: Analyzing trace with hash -997609202, now seen corresponding path program 1 times [2019-10-02 12:39:19,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:19,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:19,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:19,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:19,894 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:39:19,894 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:19,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:19,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:19,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:19,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:19,895 INFO L87 Difference]: Start difference. First operand 621 states and 960 transitions. Second operand 6 states. [2019-10-02 12:39:19,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:19,991 INFO L93 Difference]: Finished difference Result 1184 states and 1855 transitions. [2019-10-02 12:39:19,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:19,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-02 12:39:19,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:19,996 INFO L225 Difference]: With dead ends: 1184 [2019-10-02 12:39:19,996 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:39:20,000 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:39:20,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:39:20,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:39:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:39:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 959 transitions. [2019-10-02 12:39:20,020 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 959 transitions. Word has length 146 [2019-10-02 12:39:20,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:20,020 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 959 transitions. [2019-10-02 12:39:20,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 959 transitions. [2019-10-02 12:39:20,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-02 12:39:20,025 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:20,025 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] [2019-10-02 12:39:20,026 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:20,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:20,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1387851738, now seen corresponding path program 1 times [2019-10-02 12:39:20,026 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:20,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:20,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:20,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:20,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:20,223 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:39:20,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:20,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:39:20,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:39:20,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:39:20,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:39:20,226 INFO L87 Difference]: Start difference. First operand 621 states and 959 transitions. Second operand 6 states. [2019-10-02 12:39:20,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:20,353 INFO L93 Difference]: Finished difference Result 1184 states and 1854 transitions. [2019-10-02 12:39:20,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:39:20,354 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-02 12:39:20,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:20,362 INFO L225 Difference]: With dead ends: 1184 [2019-10-02 12:39:20,362 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:39:20,367 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:39:20,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:39:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:39:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:39:20,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 958 transitions. [2019-10-02 12:39:20,413 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 958 transitions. Word has length 147 [2019-10-02 12:39:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:20,416 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 958 transitions. [2019-10-02 12:39:20,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:39:20,417 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 958 transitions. [2019-10-02 12:39:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:39:20,425 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:20,425 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] [2019-10-02 12:39:20,425 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:20,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:20,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1636372693, now seen corresponding path program 1 times [2019-10-02 12:39:20,426 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:20,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:20,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:20,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:20,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:20,616 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:39:20,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:20,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:39:20,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:39:20,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:39:20,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:39:20,619 INFO L87 Difference]: Start difference. First operand 621 states and 958 transitions. Second operand 4 states. [2019-10-02 12:39:20,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:20,670 INFO L93 Difference]: Finished difference Result 1184 states and 1853 transitions. [2019-10-02 12:39:20,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:39:20,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 148 [2019-10-02 12:39:20,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:20,676 INFO L225 Difference]: With dead ends: 1184 [2019-10-02 12:39:20,677 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:39:20,681 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:39:20,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:39:20,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:39:20,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:39:20,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 957 transitions. [2019-10-02 12:39:20,712 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 957 transitions. Word has length 148 [2019-10-02 12:39:20,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:20,713 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 957 transitions. [2019-10-02 12:39:20,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:39:20,713 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 957 transitions. [2019-10-02 12:39:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-02 12:39:20,717 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:20,717 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] [2019-10-02 12:39:20,718 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:20,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash 605331795, now seen corresponding path program 1 times [2019-10-02 12:39:20,718 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:20,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:20,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:20,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:20,950 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:39:20,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:20,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:39:20,952 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:39:20,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:39:20,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:39:20,952 INFO L87 Difference]: Start difference. First operand 621 states and 957 transitions. Second operand 12 states. [2019-10-02 12:39:21,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:21,123 INFO L93 Difference]: Finished difference Result 1185 states and 1852 transitions. [2019-10-02 12:39:21,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:39:21,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-10-02 12:39:21,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:21,129 INFO L225 Difference]: With dead ends: 1185 [2019-10-02 12:39:21,129 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:39:21,134 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:39:21,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:39:21,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:39:21,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:39:21,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 956 transitions. [2019-10-02 12:39:21,156 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 956 transitions. Word has length 148 [2019-10-02 12:39:21,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:21,156 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 956 transitions. [2019-10-02 12:39:21,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:39:21,156 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 956 transitions. [2019-10-02 12:39:21,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 12:39:21,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:21,161 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] [2019-10-02 12:39:21,161 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash 974783101, now seen corresponding path program 1 times [2019-10-02 12:39:21,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:21,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:21,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:21,302 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:39:21,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:21,304 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:39:21,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:21,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 2794 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:39:21,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:22,007 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:39:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:39:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:39:22,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:22,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:22,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:22,026 INFO L87 Difference]: Start difference. First operand 621 states and 956 transitions. Second operand 7 states. [2019-10-02 12:39:23,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:23,472 INFO L93 Difference]: Finished difference Result 1730 states and 2794 transitions. [2019-10-02 12:39:23,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:39:23,472 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-10-02 12:39:23,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:23,482 INFO L225 Difference]: With dead ends: 1730 [2019-10-02 12:39:23,482 INFO L226 Difference]: Without dead ends: 1175 [2019-10-02 12:39:23,487 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:39:23,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-10-02 12:39:23,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2019-10-02 12:39:23,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1173 states. [2019-10-02 12:39:23,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1846 transitions. [2019-10-02 12:39:23,546 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1846 transitions. Word has length 149 [2019-10-02 12:39:23,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:23,547 INFO L475 AbstractCegarLoop]: Abstraction has 1173 states and 1846 transitions. [2019-10-02 12:39:23,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1846 transitions. [2019-10-02 12:39:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-02 12:39:23,552 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:23,552 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] [2019-10-02 12:39:23,553 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1329948299, now seen corresponding path program 1 times [2019-10-02 12:39:23,553 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:23,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:23,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:23,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:23,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:23,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:23,711 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:39:23,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:23,711 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:39:23,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:24,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 2798 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:39:24,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:24,272 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:39:24,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:39:24,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:39:24,281 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:24,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:24,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:24,282 INFO L87 Difference]: Start difference. First operand 1173 states and 1846 transitions. Second operand 7 states. [2019-10-02 12:39:25,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:25,526 INFO L93 Difference]: Finished difference Result 3400 states and 5552 transitions. [2019-10-02 12:39:25,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:39:25,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2019-10-02 12:39:25,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:25,547 INFO L225 Difference]: With dead ends: 3400 [2019-10-02 12:39:25,547 INFO L226 Difference]: Without dead ends: 2293 [2019-10-02 12:39:25,557 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:39:25,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2293 states. [2019-10-02 12:39:25,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2293 to 2290. [2019-10-02 12:39:25,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2290 states. [2019-10-02 12:39:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2290 states to 2290 states and 3656 transitions. [2019-10-02 12:39:25,657 INFO L78 Accepts]: Start accepts. Automaton has 2290 states and 3656 transitions. Word has length 152 [2019-10-02 12:39:25,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:25,658 INFO L475 AbstractCegarLoop]: Abstraction has 2290 states and 3656 transitions. [2019-10-02 12:39:25,658 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:25,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2290 states and 3656 transitions. [2019-10-02 12:39:25,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-10-02 12:39:25,663 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:25,664 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] [2019-10-02 12:39:25,664 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:25,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1774617215, now seen corresponding path program 1 times [2019-10-02 12:39:25,665 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:25,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:25,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:25,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:25,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:25,827 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:39:25,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:25,828 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:39:26,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:26,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:26,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 2802 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:39:26,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:26,453 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-02 12:39:26,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:39:26,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:39:26,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:26,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:26,463 INFO L87 Difference]: Start difference. First operand 2290 states and 3656 transitions. Second operand 7 states. [2019-10-02 12:39:27,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:27,752 INFO L93 Difference]: Finished difference Result 6781 states and 11181 transitions. [2019-10-02 12:39:27,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:39:27,752 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-10-02 12:39:27,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:27,793 INFO L225 Difference]: With dead ends: 6781 [2019-10-02 12:39:27,793 INFO L226 Difference]: Without dead ends: 4557 [2019-10-02 12:39:27,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:39:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2019-10-02 12:39:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4553. [2019-10-02 12:39:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4553 states. [2019-10-02 12:39:28,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 7354 transitions. [2019-10-02 12:39:28,090 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 7354 transitions. Word has length 155 [2019-10-02 12:39:28,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:28,091 INFO L475 AbstractCegarLoop]: Abstraction has 4553 states and 7354 transitions. [2019-10-02 12:39:28,091 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:28,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 7354 transitions. [2019-10-02 12:39:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-02 12:39:28,097 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:28,097 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] [2019-10-02 12:39:28,097 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:28,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:28,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1839253547, now seen corresponding path program 1 times [2019-10-02 12:39:28,098 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:28,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:28,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:28,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:28,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:28,224 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:39:28,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:28,225 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:39:28,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:28,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:28,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 2806 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:39:28,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:28,787 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:39:28,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:39:28,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 12:39:28,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:39:28,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:39:28,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:39:28,797 INFO L87 Difference]: Start difference. First operand 4553 states and 7354 transitions. Second operand 7 states. [2019-10-02 12:39:30,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:30,298 INFO L93 Difference]: Finished difference Result 13636 states and 22776 transitions. [2019-10-02 12:39:30,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:39:30,299 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 158 [2019-10-02 12:39:30,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:30,911 INFO L225 Difference]: With dead ends: 13636 [2019-10-02 12:39:30,912 INFO L226 Difference]: Without dead ends: 9149 [2019-10-02 12:39:30,939 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:39:30,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9149 states. [2019-10-02 12:39:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9149 to 9144. [2019-10-02 12:39:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9144 states. [2019-10-02 12:39:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9144 states to 9144 states and 14972 transitions. [2019-10-02 12:39:31,424 INFO L78 Accepts]: Start accepts. Automaton has 9144 states and 14972 transitions. Word has length 158 [2019-10-02 12:39:31,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:31,424 INFO L475 AbstractCegarLoop]: Abstraction has 9144 states and 14972 transitions. [2019-10-02 12:39:31,424 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:39:31,424 INFO L276 IsEmpty]: Start isEmpty. Operand 9144 states and 14972 transitions. [2019-10-02 12:39:31,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:39:31,430 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:31,430 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] [2019-10-02 12:39:31,431 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:31,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:31,431 INFO L82 PathProgramCache]: Analyzing trace with hash 469710977, now seen corresponding path program 1 times [2019-10-02 12:39:31,431 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:31,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:31,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:31,436 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:31,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:31,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:31,635 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:39:31,636 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:31,636 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:39:31,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:32,172 INFO L256 TraceCheckSpWp]: Trace formula consists of 2810 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:39:32,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:32,229 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): Broken pipe [2019-10-02 12:39:32,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:39:32,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 12:39:32,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:39:32,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:39:32,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:39:32,249 INFO L87 Difference]: Start difference. First operand 9144 states and 14972 transitions. Second operand 12 states. [2019-10-02 12:39:47,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:47,718 INFO L93 Difference]: Finished difference Result 48023 states and 85240 transitions. [2019-10-02 12:39:47,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-02 12:39:47,724 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 161 [2019-10-02 12:39:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:47,994 INFO L225 Difference]: With dead ends: 48023 [2019-10-02 12:39:47,994 INFO L226 Difference]: Without dead ends: 38921 [2019-10-02 12:39:48,052 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=234, Invalid=1326, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 12:39:48,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38921 states. [2019-10-02 12:39:49,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38921 to 38404. [2019-10-02 12:39:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38404 states. [2019-10-02 12:39:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38404 states to 38404 states and 67690 transitions. [2019-10-02 12:39:50,037 INFO L78 Accepts]: Start accepts. Automaton has 38404 states and 67690 transitions. Word has length 161 [2019-10-02 12:39:50,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:50,038 INFO L475 AbstractCegarLoop]: Abstraction has 38404 states and 67690 transitions. [2019-10-02 12:39:50,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:39:50,038 INFO L276 IsEmpty]: Start isEmpty. Operand 38404 states and 67690 transitions. [2019-10-02 12:39:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2019-10-02 12:39:50,105 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:50,105 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:50,105 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:50,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:50,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1476595930, now seen corresponding path program 1 times [2019-10-02 12:39:50,106 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:50,106 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:50,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:50,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:50,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:50,328 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-10-02 12:39:50,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:39:50,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:39:50,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:39:50,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:39:50,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:39:50,330 INFO L87 Difference]: Start difference. First operand 38404 states and 67690 transitions. Second operand 9 states. [2019-10-02 12:39:52,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:39:52,434 INFO L93 Difference]: Finished difference Result 56392 states and 97962 transitions. [2019-10-02 12:39:52,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:39:52,434 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 352 [2019-10-02 12:39:52,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:39:52,515 INFO L225 Difference]: With dead ends: 56392 [2019-10-02 12:39:52,515 INFO L226 Difference]: Without dead ends: 18042 [2019-10-02 12:39:52,635 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:39:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18042 states. [2019-10-02 12:39:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18042 to 18042. [2019-10-02 12:39:53,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18042 states. [2019-10-02 12:39:53,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18042 states to 18042 states and 30326 transitions. [2019-10-02 12:39:53,317 INFO L78 Accepts]: Start accepts. Automaton has 18042 states and 30326 transitions. Word has length 352 [2019-10-02 12:39:53,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:39:53,317 INFO L475 AbstractCegarLoop]: Abstraction has 18042 states and 30326 transitions. [2019-10-02 12:39:53,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:39:53,317 INFO L276 IsEmpty]: Start isEmpty. Operand 18042 states and 30326 transitions. [2019-10-02 12:39:53,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2019-10-02 12:39:53,341 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:39:53,343 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:39:53,343 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:39:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:39:53,344 INFO L82 PathProgramCache]: Analyzing trace with hash 825490314, now seen corresponding path program 1 times [2019-10-02 12:39:53,344 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:39:53,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:39:53,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:53,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:53,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:39:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-02 12:39:53,639 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:39:53,639 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:39:53,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:39:54,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:39:54,240 INFO L256 TraceCheckSpWp]: Trace formula consists of 4139 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:39:54,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:39:54,649 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 189 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:39:54,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:39:54,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 16 [2019-10-02 12:39:54,670 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-02 12:39:54,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-02 12:39:54,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:39:54,671 INFO L87 Difference]: Start difference. First operand 18042 states and 30326 transitions. Second operand 16 states. [2019-10-02 12:40:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:10,116 INFO L93 Difference]: Finished difference Result 58859 states and 113616 transitions. [2019-10-02 12:40:10,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:40:10,119 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 371 [2019-10-02 12:40:10,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:10,563 INFO L225 Difference]: With dead ends: 58859 [2019-10-02 12:40:10,564 INFO L226 Difference]: Without dead ends: 40880 [2019-10-02 12:40:10,717 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 420 GetRequests, 388 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=913, Unknown=0, NotChecked=0, Total=1122 [2019-10-02 12:40:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40880 states. [2019-10-02 12:40:14,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40880 to 38682. [2019-10-02 12:40:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38682 states. [2019-10-02 12:40:14,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38682 states to 38682 states and 68744 transitions. [2019-10-02 12:40:14,628 INFO L78 Accepts]: Start accepts. Automaton has 38682 states and 68744 transitions. Word has length 371 [2019-10-02 12:40:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:40:14,629 INFO L475 AbstractCegarLoop]: Abstraction has 38682 states and 68744 transitions. [2019-10-02 12:40:14,629 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-02 12:40:14,629 INFO L276 IsEmpty]: Start isEmpty. Operand 38682 states and 68744 transitions. [2019-10-02 12:40:14,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2019-10-02 12:40:14,665 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:40:14,665 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:14,665 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:40:14,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:40:14,666 INFO L82 PathProgramCache]: Analyzing trace with hash 2048069721, now seen corresponding path program 1 times [2019-10-02 12:40:14,666 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:40:14,666 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:40:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:14,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:14,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:40:14,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:15,019 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-02 12:40:15,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:40:15,019 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:40:15,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:40:15,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:40:15,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 4198 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:40:15,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:40:16,119 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:40:16,129 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:40:16,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-10-02 12:40:16,131 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:40:16,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:40:16,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:40:16,131 INFO L87 Difference]: Start difference. First operand 38682 states and 68744 transitions. Second operand 11 states. [2019-10-02 12:40:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:40:47,584 INFO L93 Difference]: Finished difference Result 266614 states and 958032 transitions. [2019-10-02 12:40:47,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:40:47,584 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 386 [2019-10-02 12:40:47,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:40:50,567 INFO L225 Difference]: With dead ends: 266614 [2019-10-02 12:40:50,568 INFO L226 Difference]: Without dead ends: 227995 [2019-10-02 12:40:57,390 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 665 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=1912, Unknown=0, NotChecked=0, Total=2256 [2019-10-02 12:40:57,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227995 states. [2019-10-02 12:41:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227995 to 192666. [2019-10-02 12:41:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192666 states. [2019-10-02 12:41:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192666 states to 192666 states and 438242 transitions. [2019-10-02 12:41:27,177 INFO L78 Accepts]: Start accepts. Automaton has 192666 states and 438242 transitions. Word has length 386 [2019-10-02 12:41:27,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:41:27,178 INFO L475 AbstractCegarLoop]: Abstraction has 192666 states and 438242 transitions. [2019-10-02 12:41:27,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:41:27,178 INFO L276 IsEmpty]: Start isEmpty. Operand 192666 states and 438242 transitions. [2019-10-02 12:41:27,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-10-02 12:41:27,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:41:27,266 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:27,266 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:41:27,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:41:27,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1204856397, now seen corresponding path program 1 times [2019-10-02 12:41:27,267 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:41:27,267 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:41:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:27,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:27,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:41:27,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:27,566 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-10-02 12:41:27,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:41:27,566 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:41:27,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:41:28,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:41:28,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 4201 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-02 12:41:28,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:41:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2019-10-02 12:41:28,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:41:28,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-10-02 12:41:28,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:41:28,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:41:28,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:41:28,740 INFO L87 Difference]: Start difference. First operand 192666 states and 438242 transitions. Second operand 11 states.