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_spec1_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:05:17,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:05:17,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:05:17,506 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:05:17,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:05:17,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:05:17,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:05:17,511 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:05:17,512 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:05:17,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:05:17,514 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:05:17,516 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:05:17,516 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:05:17,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:05:17,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:05:17,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:05:17,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:05:17,521 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:05:17,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:05:17,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:05:17,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:05:17,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:05:17,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:05:17,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:05:17,533 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:05:17,533 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:05:17,533 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:05:17,534 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:05:17,535 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:05:17,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:05:17,536 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:05:17,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:05:17,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:05:17,538 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:05:17,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:05:17,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:05:17,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:05:17,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:05:17,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:05:17,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:05:17,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:05:17,543 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:05:17,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:05:17,561 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:05:17,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:05:17,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:05:17,562 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:05:17,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:05:17,563 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:05:17,563 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:05:17,563 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:05:17,563 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:05:17,564 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:05:17,564 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:05:17,565 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:05:17,565 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:05:17,565 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:05:17,565 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:05:17,565 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:05:17,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:05:17,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:05:17,566 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:05:17,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:05:17,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:05:17,568 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:05:17,568 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:05:17,568 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:05:17,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:05:17,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:05:17,568 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:05:17,569 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:05:17,608 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:05:17,621 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:05:17,624 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:05:17,626 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:05:17,626 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:05:17,627 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product24.cil.c [2019-10-02 12:05:17,692 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bc14309/f46464f2564d4e5fb9fffeb19022af62/FLAGd29d77126 [2019-10-02 12:05:18,382 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:05:18,382 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product24.cil.c [2019-10-02 12:05:18,422 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bc14309/f46464f2564d4e5fb9fffeb19022af62/FLAGd29d77126 [2019-10-02 12:05:18,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58bc14309/f46464f2564d4e5fb9fffeb19022af62 [2019-10-02 12:05:18,569 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:05:18,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:05:18,572 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:05:18,573 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:05:18,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:05:18,578 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:05:18" (1/1) ... [2019-10-02 12:05:18,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11aa4f2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:18, skipping insertion in model container [2019-10-02 12:05:18,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:05:18" (1/1) ... [2019-10-02 12:05:18,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:05:18,693 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:05:19,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:05:19,488 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:05:19,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:05:19,716 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:05:19,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19 WrapperNode [2019-10-02 12:05:19,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:05:19,717 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:05:19,717 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:05:19,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:05:19,728 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (1/1) ... [2019-10-02 12:05:19,728 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (1/1) ... [2019-10-02 12:05:19,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (1/1) ... [2019-10-02 12:05:19,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (1/1) ... [2019-10-02 12:05:19,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (1/1) ... [2019-10-02 12:05:19,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (1/1) ... [2019-10-02 12:05:19,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (1/1) ... [2019-10-02 12:05:19,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:05:19,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:05:19,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:05:19,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:05:19,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (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:05:20,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:05:20,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:05:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:05:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:05:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:05:20,040 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:05:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:05:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:05:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:05:20,041 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:05:20,042 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:05:20,042 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:05:20,042 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:05:20,042 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:05:20,043 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:05:20,043 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:05:20,043 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:05:20,043 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:05:20,044 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:05:20,044 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:05:20,044 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:05:20,046 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:05:20,046 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:05:20,046 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:05:20,046 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:05:20,047 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:05:20,047 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:05:20,047 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:05:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:05:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:05:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:05:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:05:20,048 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:05:20,049 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:05:20,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:05:20,049 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:05:20,049 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:05:20,049 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:05:20,050 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:05:20,050 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:05:20,050 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:05:20,051 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:05:20,051 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:05:20,051 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:05:20,051 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:05:20,052 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:05:20,052 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:05:20,052 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:05:20,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:05:20,052 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:05:20,052 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:05:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:05:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:05:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:05:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:05:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:05:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:05:20,053 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:05:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:05:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:05:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:05:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 12:05:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:05:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 12:05:20,054 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:05:20,055 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:05:20,055 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:05:20,055 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:05:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:05:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:05:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:05:20,056 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:05:20,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:05:20,057 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:05:20,057 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:05:20,058 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:05:20,058 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:05:20,058 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:05:20,058 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:05:20,058 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:05:20,059 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:05:20,059 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:05:20,059 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:05:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:05:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:05:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:05:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:05:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:05:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:05:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:05:20,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:05:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:05:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:05:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:05:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:05:20,062 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:05:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:05:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:05:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:05:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:05:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:05:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:05:20,063 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:05:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:05:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:05:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:05:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:05:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:05:20,064 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:05:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:05:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:05:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:05:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:05:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:05:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:05:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:05:20,065 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:05:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:05:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:05:20,066 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:05:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:05:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:05:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:05:20,067 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:05:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:05:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:05:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:05:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:05:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:05:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:05:20,069 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:05:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:05:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:05:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:05:20,070 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:05:20,071 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:05:20,071 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:05:20,071 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:05:20,071 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:05:20,072 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:05:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:05:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:05:20,075 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:05:20,076 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:05:20,082 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:05:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:05:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:05:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:05:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:05:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:05:20,083 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:05:20,084 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:05:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:05:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:05:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 12:05:20,085 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:05:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:05:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:05:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 12:05:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:05:20,086 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:05:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:05:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 12:05:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:05:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 12:05:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:05:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:05:20,087 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:05:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:05:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:05:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:05:20,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:05:22,542 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:05:22,543 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:05:22,545 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:05:22 BoogieIcfgContainer [2019-10-02 12:05:22,545 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:05:22,546 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:05:22,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:05:22,550 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:05:22,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:05:18" (1/3) ... [2019-10-02 12:05:22,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795652dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:05:22, skipping insertion in model container [2019-10-02 12:05:22,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:05:19" (2/3) ... [2019-10-02 12:05:22,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795652dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:05:22, skipping insertion in model container [2019-10-02 12:05:22,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:05:22" (3/3) ... [2019-10-02 12:05:22,553 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product24.cil.c [2019-10-02 12:05:22,564 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:05:22,576 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:05:22,594 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:05:22,639 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:05:22,640 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:05:22,640 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:05:22,640 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:05:22,641 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:05:22,641 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:05:22,641 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:05:22,641 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:05:22,641 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:05:22,688 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states. [2019-10-02 12:05:22,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:05:22,716 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:22,718 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:22,724 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:22,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:22,731 INFO L82 PathProgramCache]: Analyzing trace with hash 2036682546, now seen corresponding path program 1 times [2019-10-02 12:05:22,734 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:22,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:22,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:22,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:22,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:23,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:23,424 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:05:23,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:23,427 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:05:23,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:24,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 3176 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:05:24,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:24,177 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 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:05:24,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:24,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:05:24,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:05:24,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:05:24,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:05:24,209 INFO L87 Difference]: Start difference. First operand 818 states. Second operand 4 states. [2019-10-02 12:05:24,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:24,404 INFO L93 Difference]: Finished difference Result 1306 states and 2089 transitions. [2019-10-02 12:05:24,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:05:24,407 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 12:05:24,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:24,455 INFO L225 Difference]: With dead ends: 1306 [2019-10-02 12:05:24,455 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:05:24,469 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 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:05:24,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:05:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:05:24,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:05:24,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1038 transitions. [2019-10-02 12:05:24,667 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1038 transitions. Word has length 116 [2019-10-02 12:05:24,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:24,668 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1038 transitions. [2019-10-02 12:05:24,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:05:24,668 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1038 transitions. [2019-10-02 12:05:24,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:05:24,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:24,675 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:24,675 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:24,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1816210495, now seen corresponding path program 1 times [2019-10-02 12:05:24,676 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:24,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:24,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:24,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:24,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:24,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:24,898 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:05:24,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:24,898 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:05:25,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:25,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:25,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:25,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:05:25,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:25,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:05:25,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:25,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:25,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:25,552 INFO L87 Difference]: Start difference. First operand 657 states and 1038 transitions. Second operand 6 states. [2019-10-02 12:05:25,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:25,678 INFO L93 Difference]: Finished difference Result 1286 states and 2049 transitions. [2019-10-02 12:05:25,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:05:25,679 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-02 12:05:25,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:25,685 INFO L225 Difference]: With dead ends: 1286 [2019-10-02 12:05:25,686 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:05:25,690 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:25,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:05:25,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 657. [2019-10-02 12:05:25,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-10-02 12:05:25,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1037 transitions. [2019-10-02 12:05:25,761 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1037 transitions. Word has length 120 [2019-10-02 12:05:25,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:25,764 INFO L475 AbstractCegarLoop]: Abstraction has 657 states and 1037 transitions. [2019-10-02 12:05:25,764 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:25,764 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1037 transitions. [2019-10-02 12:05:25,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:05:25,771 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:25,771 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:25,771 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:25,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:25,772 INFO L82 PathProgramCache]: Analyzing trace with hash 920540717, now seen corresponding path program 1 times [2019-10-02 12:05:25,772 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:25,772 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:25,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:25,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:25,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:26,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:05:26,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:26,095 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:05:26,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:26,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:26,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:26,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:26,666 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:05:26,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:26,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:05:26,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:26,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:26,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:26,683 INFO L87 Difference]: Start difference. First operand 657 states and 1037 transitions. Second operand 6 states. [2019-10-02 12:05:26,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:26,775 INFO L93 Difference]: Finished difference Result 1290 states and 2052 transitions. [2019-10-02 12:05:26,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:05:26,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-02 12:05:26,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:26,783 INFO L225 Difference]: With dead ends: 1290 [2019-10-02 12:05:26,783 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 12:05:26,786 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:26,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 12:05:26,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-10-02 12:05:26,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-02 12:05:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1042 transitions. [2019-10-02 12:05:26,826 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1042 transitions. Word has length 122 [2019-10-02 12:05:26,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:26,827 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 1042 transitions. [2019-10-02 12:05:26,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:26,827 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1042 transitions. [2019-10-02 12:05:26,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:05:26,831 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:26,831 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:26,832 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:26,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:26,832 INFO L82 PathProgramCache]: Analyzing trace with hash 930906058, now seen corresponding path program 1 times [2019-10-02 12:05:26,832 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:26,832 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:26,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:26,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:26,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:05:27,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:27,058 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:05:27,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:27,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:27,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:27,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:05:27,670 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:27,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:05:27,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:27,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:27,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:27,672 INFO L87 Difference]: Start difference. First operand 663 states and 1042 transitions. Second operand 6 states. [2019-10-02 12:05:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:27,758 INFO L93 Difference]: Finished difference Result 1289 states and 2043 transitions. [2019-10-02 12:05:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:05:27,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 12:05:27,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:27,764 INFO L225 Difference]: With dead ends: 1289 [2019-10-02 12:05:27,764 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 12:05:27,768 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:05:27,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 12:05:27,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-10-02 12:05:27,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-02 12:05:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1041 transitions. [2019-10-02 12:05:27,794 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1041 transitions. Word has length 123 [2019-10-02 12:05:27,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:27,795 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 1041 transitions. [2019-10-02 12:05:27,795 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:27,796 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1041 transitions. [2019-10-02 12:05:27,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:05:27,798 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:27,799 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:27,799 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:27,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:27,799 INFO L82 PathProgramCache]: Analyzing trace with hash -289235503, now seen corresponding path program 1 times [2019-10-02 12:05:27,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:27,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:27,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:27,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:27,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:05:27,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:27,930 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:05:28,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:28,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:28,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:28,556 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:05:28,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:28,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:05:28,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:28,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:28,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:28,566 INFO L87 Difference]: Start difference. First operand 663 states and 1041 transitions. Second operand 6 states. [2019-10-02 12:05:28,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:28,675 INFO L93 Difference]: Finished difference Result 1289 states and 2042 transitions. [2019-10-02 12:05:28,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:05:28,675 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-10-02 12:05:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:28,688 INFO L225 Difference]: With dead ends: 1289 [2019-10-02 12:05:28,688 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 12:05:28,695 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:05:28,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 12:05:28,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-10-02 12:05:28,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-02 12:05:28,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1040 transitions. [2019-10-02 12:05:28,720 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1040 transitions. Word has length 124 [2019-10-02 12:05:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:28,721 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 1040 transitions. [2019-10-02 12:05:28,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:28,721 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1040 transitions. [2019-10-02 12:05:28,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:05:28,724 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:28,725 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:28,725 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:28,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1000385362, now seen corresponding path program 1 times [2019-10-02 12:05:28,726 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:28,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:28,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:28,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:28,923 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:05:28,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:28,923 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:05:29,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:29,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:29,501 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:29,548 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:05:29,556 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:29,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 12:05:29,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:05:29,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:05:29,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:05:29,558 INFO L87 Difference]: Start difference. First operand 663 states and 1040 transitions. Second operand 12 states. [2019-10-02 12:05:30,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:30,274 INFO L93 Difference]: Finished difference Result 1300 states and 2062 transitions. [2019-10-02 12:05:30,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:05:30,274 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 125 [2019-10-02 12:05:30,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:30,280 INFO L225 Difference]: With dead ends: 1300 [2019-10-02 12:05:30,280 INFO L226 Difference]: Without dead ends: 672 [2019-10-02 12:05:30,284 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:05:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-10-02 12:05:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2019-10-02 12:05:30,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-02 12:05:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1045 transitions. [2019-10-02 12:05:30,309 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1045 transitions. Word has length 125 [2019-10-02 12:05:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:30,309 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 1045 transitions. [2019-10-02 12:05:30,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:05:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1045 transitions. [2019-10-02 12:05:30,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:05:30,312 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:30,312 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:30,312 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:30,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:30,313 INFO L82 PathProgramCache]: Analyzing trace with hash -764568770, now seen corresponding path program 1 times [2019-10-02 12:05:30,313 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:30,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:30,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:30,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:30,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:30,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:05:30,438 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:30,438 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:05:30,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:30,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:30,998 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:31,028 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:05:31,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:31,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:05:31,037 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:05:31,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:05:31,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:05:31,038 INFO L87 Difference]: Start difference. First operand 670 states and 1045 transitions. Second operand 8 states. [2019-10-02 12:05:31,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:31,367 INFO L93 Difference]: Finished difference Result 1301 states and 2052 transitions. [2019-10-02 12:05:31,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:05:31,368 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-10-02 12:05:31,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:31,375 INFO L225 Difference]: With dead ends: 1301 [2019-10-02 12:05:31,375 INFO L226 Difference]: Without dead ends: 670 [2019-10-02 12:05:31,379 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-10-02 12:05:31,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2019-10-02 12:05:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-02 12:05:31,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1040 transitions. [2019-10-02 12:05:31,412 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1040 transitions. Word has length 128 [2019-10-02 12:05:31,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:31,413 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 1040 transitions. [2019-10-02 12:05:31,413 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:05:31,413 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1040 transitions. [2019-10-02 12:05:31,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 12:05:31,415 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:31,415 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:31,415 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:31,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:31,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1298528411, now seen corresponding path program 1 times [2019-10-02 12:05:31,420 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:31,420 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:31,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:31,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:31,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:31,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:31,559 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:05:31,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:31,560 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:05:31,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:32,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:32,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 3189 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:32,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:32,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:05:32,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:32,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:05:32,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:32,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:32,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:32,199 INFO L87 Difference]: Start difference. First operand 670 states and 1040 transitions. Second operand 6 states. [2019-10-02 12:05:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:32,572 INFO L93 Difference]: Finished difference Result 1337 states and 2098 transitions. [2019-10-02 12:05:32,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:05:32,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 12:05:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:32,577 INFO L225 Difference]: With dead ends: 1337 [2019-10-02 12:05:32,578 INFO L226 Difference]: Without dead ends: 699 [2019-10-02 12:05:32,581 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 129 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:05:32,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-02 12:05:32,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 696. [2019-10-02 12:05:32,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-02 12:05:32,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1082 transitions. [2019-10-02 12:05:32,613 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1082 transitions. Word has length 129 [2019-10-02 12:05:32,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:32,615 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1082 transitions. [2019-10-02 12:05:32,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:32,615 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1082 transitions. [2019-10-02 12:05:32,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:05:32,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:32,617 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:32,618 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:32,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:32,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1848911168, now seen corresponding path program 1 times [2019-10-02 12:05:32,618 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:32,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:32,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:32,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:32,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:32,754 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:05:32,757 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:32,758 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:32,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:33,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:33,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 3187 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:05:33,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:33,583 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:05:33,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:33,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:05:33,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:05:33,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:05:33,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:05:33,595 INFO L87 Difference]: Start difference. First operand 696 states and 1082 transitions. Second operand 14 states. [2019-10-02 12:05:33,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:33,989 INFO L93 Difference]: Finished difference Result 1338 states and 2100 transitions. [2019-10-02 12:05:33,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:05:33,989 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-10-02 12:05:33,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:33,995 INFO L225 Difference]: With dead ends: 1338 [2019-10-02 12:05:33,995 INFO L226 Difference]: Without dead ends: 690 [2019-10-02 12:05:33,998 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:05:34,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-10-02 12:05:34,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 685. [2019-10-02 12:05:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-02 12:05:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1062 transitions. [2019-10-02 12:05:34,037 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1062 transitions. Word has length 130 [2019-10-02 12:05:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:34,037 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 1062 transitions. [2019-10-02 12:05:34,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:05:34,037 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1062 transitions. [2019-10-02 12:05:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:05:34,039 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:34,040 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:34,040 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:34,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:34,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1727681374, now seen corresponding path program 1 times [2019-10-02 12:05:34,041 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:34,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:34,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:34,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:34,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:34,257 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:05:34,258 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:34,258 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:34,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 3190 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:34,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:05:34,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:34,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:05:34,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:05:34,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:05:34,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:05:34,886 INFO L87 Difference]: Start difference. First operand 685 states and 1062 transitions. Second operand 8 states. [2019-10-02 12:05:35,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:35,147 INFO L93 Difference]: Finished difference Result 1324 states and 2078 transitions. [2019-10-02 12:05:35,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:05:35,148 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-02 12:05:35,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:35,153 INFO L225 Difference]: With dead ends: 1324 [2019-10-02 12:05:35,153 INFO L226 Difference]: Without dead ends: 685 [2019-10-02 12:05:35,157 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:35,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-02 12:05:35,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2019-10-02 12:05:35,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-02 12:05:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1046 transitions. [2019-10-02 12:05:35,179 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1046 transitions. Word has length 133 [2019-10-02 12:05:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:35,179 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 1046 transitions. [2019-10-02 12:05:35,180 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:05:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1046 transitions. [2019-10-02 12:05:35,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:05:35,182 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:35,182 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:35,182 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:35,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:35,182 INFO L82 PathProgramCache]: Analyzing trace with hash 2098079192, now seen corresponding path program 1 times [2019-10-02 12:05:35,183 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:35,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:35,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:35,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:35,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:05:35,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:35,303 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:35,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:35,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:35,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 3191 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:35,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:36,002 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:05:36,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:36,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:05:36,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:05:36,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:05:36,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:05:36,022 INFO L87 Difference]: Start difference. First operand 685 states and 1046 transitions. Second operand 8 states. [2019-10-02 12:05:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:36,287 INFO L93 Difference]: Finished difference Result 1320 states and 2038 transitions. [2019-10-02 12:05:36,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:05:36,288 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-10-02 12:05:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:36,293 INFO L225 Difference]: With dead ends: 1320 [2019-10-02 12:05:36,294 INFO L226 Difference]: Without dead ends: 685 [2019-10-02 12:05:36,298 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:36,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-02 12:05:36,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 685. [2019-10-02 12:05:36,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2019-10-02 12:05:36,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 1045 transitions. [2019-10-02 12:05:36,363 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 1045 transitions. Word has length 134 [2019-10-02 12:05:36,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:36,364 INFO L475 AbstractCegarLoop]: Abstraction has 685 states and 1045 transitions. [2019-10-02 12:05:36,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:05:36,364 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 1045 transitions. [2019-10-02 12:05:36,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:05:36,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:36,367 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:36,367 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash -2053443655, now seen corresponding path program 1 times [2019-10-02 12:05:36,368 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:36,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:36,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:36,598 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:05:36,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:36,599 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:36,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:37,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 3192 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:05:37,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:37,277 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:05:37,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:37,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:05:37,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:05:37,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:05:37,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:05:37,287 INFO L87 Difference]: Start difference. First operand 685 states and 1045 transitions. Second operand 18 states. [2019-10-02 12:05:37,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:37,828 INFO L93 Difference]: Finished difference Result 1336 states and 2065 transitions. [2019-10-02 12:05:37,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:05:37,828 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2019-10-02 12:05:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:37,834 INFO L225 Difference]: With dead ends: 1336 [2019-10-02 12:05:37,835 INFO L226 Difference]: Without dead ends: 700 [2019-10-02 12:05:37,839 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:05:37,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2019-10-02 12:05:37,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 696. [2019-10-02 12:05:37,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-02 12:05:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1053 transitions. [2019-10-02 12:05:37,871 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1053 transitions. Word has length 135 [2019-10-02 12:05:37,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:37,872 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1053 transitions. [2019-10-02 12:05:37,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:05:37,873 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1053 transitions. [2019-10-02 12:05:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:05:37,875 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:37,875 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:37,875 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:37,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1995307882, now seen corresponding path program 1 times [2019-10-02 12:05:37,876 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:37,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:37,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:37,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:37,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:38,005 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:05:38,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:38,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:05:38,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:05:38,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:05:38,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:38,007 INFO L87 Difference]: Start difference. First operand 696 states and 1053 transitions. Second operand 7 states. [2019-10-02 12:05:38,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:38,098 INFO L93 Difference]: Finished difference Result 1252 states and 1941 transitions. [2019-10-02 12:05:38,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:05:38,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-10-02 12:05:38,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:38,104 INFO L225 Difference]: With dead ends: 1252 [2019-10-02 12:05:38,104 INFO L226 Difference]: Without dead ends: 660 [2019-10-02 12:05:38,108 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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:05:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-02 12:05:38,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 658. [2019-10-02 12:05:38,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2019-10-02 12:05:38,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1002 transitions. [2019-10-02 12:05:38,129 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1002 transitions. Word has length 136 [2019-10-02 12:05:38,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:38,130 INFO L475 AbstractCegarLoop]: Abstraction has 658 states and 1002 transitions. [2019-10-02 12:05:38,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:05:38,130 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1002 transitions. [2019-10-02 12:05:38,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:05:38,132 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:38,132 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:38,133 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:38,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash 934643819, now seen corresponding path program 1 times [2019-10-02 12:05:38,133 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:38,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:38,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:38,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:38,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:38,323 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:05:38,323 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:38,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:05:38,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:05:38,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:05:38,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:05:38,325 INFO L87 Difference]: Start difference. First operand 658 states and 1002 transitions. Second operand 13 states. [2019-10-02 12:05:38,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:38,647 INFO L93 Difference]: Finished difference Result 1283 states and 1980 transitions. [2019-10-02 12:05:38,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:05:38,648 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-10-02 12:05:38,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:38,653 INFO L225 Difference]: With dead ends: 1283 [2019-10-02 12:05:38,653 INFO L226 Difference]: Without dead ends: 672 [2019-10-02 12:05:38,657 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:05:38,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2019-10-02 12:05:38,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2019-10-02 12:05:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 670 states. [2019-10-02 12:05:38,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 1017 transitions. [2019-10-02 12:05:38,709 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 1017 transitions. Word has length 138 [2019-10-02 12:05:38,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:38,710 INFO L475 AbstractCegarLoop]: Abstraction has 670 states and 1017 transitions. [2019-10-02 12:05:38,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:05:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 1017 transitions. [2019-10-02 12:05:38,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:05:38,712 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:38,713 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:38,713 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:38,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:38,713 INFO L82 PathProgramCache]: Analyzing trace with hash 527619460, now seen corresponding path program 1 times [2019-10-02 12:05:38,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:38,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:38,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:38,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:38,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:38,922 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:05:38,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:38,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:05:38,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:05:38,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:05:38,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:05:38,924 INFO L87 Difference]: Start difference. First operand 670 states and 1017 transitions. Second operand 13 states. [2019-10-02 12:05:39,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:39,238 INFO L93 Difference]: Finished difference Result 1227 states and 1903 transitions. [2019-10-02 12:05:39,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:05:39,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2019-10-02 12:05:39,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:39,243 INFO L225 Difference]: With dead ends: 1227 [2019-10-02 12:05:39,244 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 12:05:39,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:05:39,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 12:05:39,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-10-02 12:05:39,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-02 12:05:39,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1008 transitions. [2019-10-02 12:05:39,269 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1008 transitions. Word has length 137 [2019-10-02 12:05:39,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:39,269 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 1008 transitions. [2019-10-02 12:05:39,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:05:39,270 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1008 transitions. [2019-10-02 12:05:39,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:05:39,272 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:39,272 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:39,272 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:39,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:39,273 INFO L82 PathProgramCache]: Analyzing trace with hash 628700265, now seen corresponding path program 1 times [2019-10-02 12:05:39,273 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:39,273 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:39,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:39,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:39,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:39,449 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:05:39,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:39,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:05:39,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:05:39,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:05:39,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:39,451 INFO L87 Difference]: Start difference. First operand 663 states and 1008 transitions. Second operand 11 states. [2019-10-02 12:05:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:39,719 INFO L93 Difference]: Finished difference Result 1220 states and 1894 transitions. [2019-10-02 12:05:39,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:05:39,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-10-02 12:05:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:39,724 INFO L225 Difference]: With dead ends: 1220 [2019-10-02 12:05:39,724 INFO L226 Difference]: Without dead ends: 663 [2019-10-02 12:05:39,728 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:05:39,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2019-10-02 12:05:39,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 663. [2019-10-02 12:05:39,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2019-10-02 12:05:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 1007 transitions. [2019-10-02 12:05:39,749 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 1007 transitions. Word has length 139 [2019-10-02 12:05:39,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:39,750 INFO L475 AbstractCegarLoop]: Abstraction has 663 states and 1007 transitions. [2019-10-02 12:05:39,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:05:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 1007 transitions. [2019-10-02 12:05:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:05:39,752 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:39,752 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:39,753 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:39,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:39,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1028980462, now seen corresponding path program 1 times [2019-10-02 12:05:39,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:39,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:39,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:39,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:39,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:39,919 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:05:39,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:39,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:05:39,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:05:39,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:05:39,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:05:39,921 INFO L87 Difference]: Start difference. First operand 663 states and 1007 transitions. Second operand 11 states. [2019-10-02 12:05:40,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:40,157 INFO L93 Difference]: Finished difference Result 1269 states and 1951 transitions. [2019-10-02 12:05:40,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:05:40,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-10-02 12:05:40,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:40,162 INFO L225 Difference]: With dead ends: 1269 [2019-10-02 12:05:40,162 INFO L226 Difference]: Without dead ends: 660 [2019-10-02 12:05:40,164 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:05:40,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2019-10-02 12:05:40,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2019-10-02 12:05:40,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-10-02 12:05:40,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 999 transitions. [2019-10-02 12:05:40,184 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 999 transitions. Word has length 140 [2019-10-02 12:05:40,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:40,185 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 999 transitions. [2019-10-02 12:05:40,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:05:40,185 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 999 transitions. [2019-10-02 12:05:40,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:05:40,187 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:40,187 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:05:40,187 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:40,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:40,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1795722660, now seen corresponding path program 1 times [2019-10-02 12:05:40,188 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:40,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:40,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:40,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:40,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:40,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:40,342 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:05:40,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:40,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:40,343 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:40,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:40,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:40,344 INFO L87 Difference]: Start difference. First operand 660 states and 999 transitions. Second operand 6 states. [2019-10-02 12:05:44,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:44,018 INFO L93 Difference]: Finished difference Result 1866 states and 2945 transitions. [2019-10-02 12:05:44,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:05:44,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 12:05:44,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:44,032 INFO L225 Difference]: With dead ends: 1866 [2019-10-02 12:05:44,033 INFO L226 Difference]: Without dead ends: 1318 [2019-10-02 12:05:44,035 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:05:44,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-10-02 12:05:44,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1202. [2019-10-02 12:05:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1202 states. [2019-10-02 12:05:44,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1202 states to 1202 states and 1881 transitions. [2019-10-02 12:05:44,097 INFO L78 Accepts]: Start accepts. Automaton has 1202 states and 1881 transitions. Word has length 141 [2019-10-02 12:05:44,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:44,098 INFO L475 AbstractCegarLoop]: Abstraction has 1202 states and 1881 transitions. [2019-10-02 12:05:44,098 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1202 states and 1881 transitions. [2019-10-02 12:05:44,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-02 12:05:44,104 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:44,104 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:44,104 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:44,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:44,105 INFO L82 PathProgramCache]: Analyzing trace with hash -440906610, now seen corresponding path program 1 times [2019-10-02 12:05:44,105 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:44,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:44,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:44,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:44,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:44,300 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 12:05:44,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:44,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:05:44,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:05:44,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:05:44,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:05:44,303 INFO L87 Difference]: Start difference. First operand 1202 states and 1881 transitions. Second operand 12 states. [2019-10-02 12:05:55,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:55,423 INFO L93 Difference]: Finished difference Result 3862 states and 6099 transitions. [2019-10-02 12:05:55,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:05:55,423 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 199 [2019-10-02 12:05:55,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:55,439 INFO L225 Difference]: With dead ends: 3862 [2019-10-02 12:05:55,439 INFO L226 Difference]: Without dead ends: 2772 [2019-10-02 12:05:55,444 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:05:55,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-10-02 12:05:55,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2714. [2019-10-02 12:05:55,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-10-02 12:05:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 4234 transitions. [2019-10-02 12:05:55,560 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 4234 transitions. Word has length 199 [2019-10-02 12:05:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:55,560 INFO L475 AbstractCegarLoop]: Abstraction has 2714 states and 4234 transitions. [2019-10-02 12:05:55,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:05:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 4234 transitions. [2019-10-02 12:05:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 12:05:55,567 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:55,567 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:55,567 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:55,568 INFO L82 PathProgramCache]: Analyzing trace with hash 855428073, now seen corresponding path program 1 times [2019-10-02 12:05:55,568 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:55,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:55,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:55,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:55,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:55,779 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 12:05:55,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:55,780 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:55,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:56,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:56,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 3577 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:05:56,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:56,540 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:05:56,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:56,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:05:56,559 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:05:56,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:05:56,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:05:56,560 INFO L87 Difference]: Start difference. First operand 2714 states and 4234 transitions. Second operand 14 states. [2019-10-02 12:06:03,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:03,055 INFO L93 Difference]: Finished difference Result 5460 states and 8820 transitions. [2019-10-02 12:06:03,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:06:03,056 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 200 [2019-10-02 12:06:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:03,073 INFO L225 Difference]: With dead ends: 5460 [2019-10-02 12:06:03,073 INFO L226 Difference]: Without dead ends: 2858 [2019-10-02 12:06:03,089 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-10-02 12:06:03,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-10-02 12:06:03,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2832. [2019-10-02 12:06:03,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2832 states. [2019-10-02 12:06:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2832 states to 2832 states and 4454 transitions. [2019-10-02 12:06:03,225 INFO L78 Accepts]: Start accepts. Automaton has 2832 states and 4454 transitions. Word has length 200 [2019-10-02 12:06:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:03,225 INFO L475 AbstractCegarLoop]: Abstraction has 2832 states and 4454 transitions. [2019-10-02 12:06:03,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:06:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2832 states and 4454 transitions. [2019-10-02 12:06:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-10-02 12:06:03,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:03,232 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:03,232 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:03,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:03,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1391841431, now seen corresponding path program 1 times [2019-10-02 12:06:03,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:03,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:03,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:03,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:03,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:06:03,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:03,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:03,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:03,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:03,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:03,437 INFO L87 Difference]: Start difference. First operand 2832 states and 4454 transitions. Second operand 6 states. [2019-10-02 12:06:04,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:04,220 INFO L93 Difference]: Finished difference Result 5608 states and 9060 transitions. [2019-10-02 12:06:04,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:04,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 202 [2019-10-02 12:06:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:04,241 INFO L225 Difference]: With dead ends: 5608 [2019-10-02 12:06:04,241 INFO L226 Difference]: Without dead ends: 2872 [2019-10-02 12:06:04,256 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:04,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2019-10-02 12:06:04,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2872. [2019-10-02 12:06:04,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2872 states. [2019-10-02 12:06:04,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2872 states to 2872 states and 4472 transitions. [2019-10-02 12:06:04,396 INFO L78 Accepts]: Start accepts. Automaton has 2872 states and 4472 transitions. Word has length 202 [2019-10-02 12:06:04,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:04,397 INFO L475 AbstractCegarLoop]: Abstraction has 2872 states and 4472 transitions. [2019-10-02 12:06:04,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:04,397 INFO L276 IsEmpty]: Start isEmpty. Operand 2872 states and 4472 transitions. [2019-10-02 12:06:04,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2019-10-02 12:06:04,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:04,406 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:04,406 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:04,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:04,407 INFO L82 PathProgramCache]: Analyzing trace with hash -941398999, now seen corresponding path program 1 times [2019-10-02 12:06:04,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:04,407 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:04,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:04,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:06:04,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:04,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:04,578 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:04,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:04,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:04,578 INFO L87 Difference]: Start difference. First operand 2872 states and 4472 transitions. Second operand 6 states. [2019-10-02 12:06:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:05,393 INFO L93 Difference]: Finished difference Result 5696 states and 9094 transitions. [2019-10-02 12:06:05,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:06:05,401 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 204 [2019-10-02 12:06:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:05,419 INFO L225 Difference]: With dead ends: 5696 [2019-10-02 12:06:05,419 INFO L226 Difference]: Without dead ends: 2920 [2019-10-02 12:06:05,432 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2920 states. [2019-10-02 12:06:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2920 to 2920. [2019-10-02 12:06:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2920 states. [2019-10-02 12:06:05,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 4498 transitions. [2019-10-02 12:06:05,619 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 4498 transitions. Word has length 204 [2019-10-02 12:06:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:05,619 INFO L475 AbstractCegarLoop]: Abstraction has 2920 states and 4498 transitions. [2019-10-02 12:06:05,620 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 4498 transitions. [2019-10-02 12:06:05,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-02 12:06:05,628 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:05,628 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:05,628 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:05,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash -915626801, now seen corresponding path program 1 times [2019-10-02 12:06:05,629 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:05,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:05,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:05,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:06:05,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:05,858 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:06,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:06,555 INFO L256 TraceCheckSpWp]: Trace formula consists of 3583 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:06:06,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:06,680 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:06:06,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:06,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:06:06,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:06:06,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:06:06,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:06:06,700 INFO L87 Difference]: Start difference. First operand 2920 states and 4498 transitions. Second operand 14 states. [2019-10-02 12:06:20,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:20,329 INFO L93 Difference]: Finished difference Result 8986 states and 14290 transitions. [2019-10-02 12:06:20,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:06:20,330 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 206 [2019-10-02 12:06:20,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:20,395 INFO L225 Difference]: With dead ends: 8986 [2019-10-02 12:06:20,395 INFO L226 Difference]: Without dead ends: 6178 [2019-10-02 12:06:20,411 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:06:20,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2019-10-02 12:06:20,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 6061. [2019-10-02 12:06:20,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6061 states. [2019-10-02 12:06:20,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6061 states to 6061 states and 9424 transitions. [2019-10-02 12:06:20,863 INFO L78 Accepts]: Start accepts. Automaton has 6061 states and 9424 transitions. Word has length 206 [2019-10-02 12:06:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:20,864 INFO L475 AbstractCegarLoop]: Abstraction has 6061 states and 9424 transitions. [2019-10-02 12:06:20,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:06:20,864 INFO L276 IsEmpty]: Start isEmpty. Operand 6061 states and 9424 transitions. [2019-10-02 12:06:20,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-10-02 12:06:20,880 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:20,881 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:20,881 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:20,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:20,882 INFO L82 PathProgramCache]: Analyzing trace with hash -117593495, now seen corresponding path program 1 times [2019-10-02 12:06:20,882 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:20,882 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:20,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:20,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:20,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:21,228 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:06:21,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:21,228 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:21,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:21,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 3585 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:06:21,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:21,909 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 12:06:21,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:21,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:06:21,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:06:21,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:06:21,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:06:21,918 INFO L87 Difference]: Start difference. First operand 6061 states and 9424 transitions. Second operand 14 states. [2019-10-02 12:06:33,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:33,847 INFO L93 Difference]: Finished difference Result 15292 states and 24229 transitions. [2019-10-02 12:06:33,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:06:33,848 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 208 [2019-10-02 12:06:33,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:33,904 INFO L225 Difference]: With dead ends: 15292 [2019-10-02 12:06:33,905 INFO L226 Difference]: Without dead ends: 9352 [2019-10-02 12:06:33,924 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:06:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9352 states. [2019-10-02 12:06:34,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9352 to 9021. [2019-10-02 12:06:34,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9021 states. [2019-10-02 12:06:34,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9021 states to 9021 states and 14039 transitions. [2019-10-02 12:06:34,460 INFO L78 Accepts]: Start accepts. Automaton has 9021 states and 14039 transitions. Word has length 208 [2019-10-02 12:06:34,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:34,461 INFO L475 AbstractCegarLoop]: Abstraction has 9021 states and 14039 transitions. [2019-10-02 12:06:34,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:06:34,461 INFO L276 IsEmpty]: Start isEmpty. Operand 9021 states and 14039 transitions. [2019-10-02 12:06:34,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:06:34,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:34,478 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:34,478 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:34,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:34,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1140247895, now seen corresponding path program 1 times [2019-10-02 12:06:34,479 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:34,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:34,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:34,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:34,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:34,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:34,642 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:06:34,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:34,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:06:34,643 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:06:34,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:06:34,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:06:34,643 INFO L87 Difference]: Start difference. First operand 9021 states and 14039 transitions. Second operand 9 states. [2019-10-02 12:06:34,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:34,911 INFO L93 Difference]: Finished difference Result 11851 states and 18423 transitions. [2019-10-02 12:06:34,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:06:34,911 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 216 [2019-10-02 12:06:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:34,924 INFO L225 Difference]: With dead ends: 11851 [2019-10-02 12:06:34,924 INFO L226 Difference]: Without dead ends: 2931 [2019-10-02 12:06:34,946 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:06:34,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2931 states. [2019-10-02 12:06:35,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2931 to 2931. [2019-10-02 12:06:35,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2931 states. [2019-10-02 12:06:35,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2931 states to 2931 states and 4492 transitions. [2019-10-02 12:06:35,086 INFO L78 Accepts]: Start accepts. Automaton has 2931 states and 4492 transitions. Word has length 216 [2019-10-02 12:06:35,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:35,086 INFO L475 AbstractCegarLoop]: Abstraction has 2931 states and 4492 transitions. [2019-10-02 12:06:35,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:06:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2931 states and 4492 transitions. [2019-10-02 12:06:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 12:06:35,092 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:35,093 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:06:35,093 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:35,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:35,093 INFO L82 PathProgramCache]: Analyzing trace with hash 279619429, now seen corresponding path program 1 times [2019-10-02 12:06:35,093 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:35,094 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:35,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:35,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:35,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:35,472 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:06:35,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:35,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:06:35,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:06:35,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:06:35,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:06:35,475 INFO L87 Difference]: Start difference. First operand 2931 states and 4492 transitions. Second operand 11 states. [2019-10-02 12:06:40,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:40,396 INFO L93 Difference]: Finished difference Result 5752 states and 8905 transitions. [2019-10-02 12:06:40,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:06:40,397 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 225 [2019-10-02 12:06:40,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:40,408 INFO L225 Difference]: With dead ends: 5752 [2019-10-02 12:06:40,408 INFO L226 Difference]: Without dead ends: 2939 [2019-10-02 12:06:40,416 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:06:40,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2939 states. [2019-10-02 12:06:40,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2939 to 2919. [2019-10-02 12:06:40,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2019-10-02 12:06:40,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4468 transitions. [2019-10-02 12:06:40,544 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4468 transitions. Word has length 225 [2019-10-02 12:06:40,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:40,545 INFO L475 AbstractCegarLoop]: Abstraction has 2919 states and 4468 transitions. [2019-10-02 12:06:40,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:06:40,545 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4468 transitions. [2019-10-02 12:06:40,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2019-10-02 12:06:40,551 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:40,552 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:06:40,552 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:40,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:40,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1002928098, now seen corresponding path program 1 times [2019-10-02 12:06:40,552 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:40,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:40,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:40,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:40,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:40,718 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:06:40,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:40,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:40,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:40,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:40,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:40,719 INFO L87 Difference]: Start difference. First operand 2919 states and 4468 transitions. Second operand 6 states. [2019-10-02 12:06:44,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:44,724 INFO L93 Difference]: Finished difference Result 7385 states and 11561 transitions. [2019-10-02 12:06:44,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:06:44,725 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 239 [2019-10-02 12:06:44,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:44,743 INFO L225 Difference]: With dead ends: 7385 [2019-10-02 12:06:44,744 INFO L226 Difference]: Without dead ends: 4584 [2019-10-02 12:06:44,754 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:06:44,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4584 states. [2019-10-02 12:06:44,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4584 to 4344. [2019-10-02 12:06:44,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2019-10-02 12:06:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 6645 transitions. [2019-10-02 12:06:44,999 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 6645 transitions. Word has length 239 [2019-10-02 12:06:44,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:44,999 INFO L475 AbstractCegarLoop]: Abstraction has 4344 states and 6645 transitions. [2019-10-02 12:06:45,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:45,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 6645 transitions. [2019-10-02 12:06:45,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:06:45,012 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:45,013 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:06:45,013 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:45,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:45,014 INFO L82 PathProgramCache]: Analyzing trace with hash -585525732, now seen corresponding path program 1 times [2019-10-02 12:06:45,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:45,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:45,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:45,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:45,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:45,186 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:06:45,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:45,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:45,188 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:45,189 INFO L87 Difference]: Start difference. First operand 4344 states and 6645 transitions. Second operand 6 states. [2019-10-02 12:06:49,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:49,490 INFO L93 Difference]: Finished difference Result 12017 states and 18833 transitions. [2019-10-02 12:06:49,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:06:49,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-10-02 12:06:49,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:49,523 INFO L225 Difference]: With dead ends: 12017 [2019-10-02 12:06:49,524 INFO L226 Difference]: Without dead ends: 7795 [2019-10-02 12:06:49,540 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:06:49,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7795 states. [2019-10-02 12:06:49,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7795 to 7379. [2019-10-02 12:06:49,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7379 states. [2019-10-02 12:06:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7379 states to 7379 states and 11316 transitions. [2019-10-02 12:06:49,924 INFO L78 Accepts]: Start accepts. Automaton has 7379 states and 11316 transitions. Word has length 240 [2019-10-02 12:06:49,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:49,924 INFO L475 AbstractCegarLoop]: Abstraction has 7379 states and 11316 transitions. [2019-10-02 12:06:49,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 7379 states and 11316 transitions. [2019-10-02 12:06:49,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-10-02 12:06:49,934 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:49,934 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:06:49,934 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:49,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:49,935 INFO L82 PathProgramCache]: Analyzing trace with hash 827590234, now seen corresponding path program 1 times [2019-10-02 12:06:49,935 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:49,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:49,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:49,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:49,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:50,108 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:06:50,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:50,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:50,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:50,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:50,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:50,110 INFO L87 Difference]: Start difference. First operand 7379 states and 11316 transitions. Second operand 6 states. [2019-10-02 12:06:54,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:54,738 INFO L93 Difference]: Finished difference Result 22151 states and 34931 transitions. [2019-10-02 12:06:54,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:06:54,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 241 [2019-10-02 12:06:54,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:54,816 INFO L225 Difference]: With dead ends: 22151 [2019-10-02 12:06:54,816 INFO L226 Difference]: Without dead ends: 14902 [2019-10-02 12:06:54,846 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:06:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14902 states. [2019-10-02 12:06:55,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14902 to 13975. [2019-10-02 12:06:55,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13975 states. [2019-10-02 12:06:55,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13975 states to 13975 states and 21560 transitions. [2019-10-02 12:06:55,535 INFO L78 Accepts]: Start accepts. Automaton has 13975 states and 21560 transitions. Word has length 241 [2019-10-02 12:06:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:55,535 INFO L475 AbstractCegarLoop]: Abstraction has 13975 states and 21560 transitions. [2019-10-02 12:06:55,536 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:06:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 13975 states and 21560 transitions. [2019-10-02 12:06:55,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2019-10-02 12:06:55,557 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:55,558 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:06:55,558 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:55,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1251910568, now seen corresponding path program 1 times [2019-10-02 12:06:55,559 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:55,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:55,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:55,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:55,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:55,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:06:55,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:55,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:06:55,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:06:55,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:06:55,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:06:55,926 INFO L87 Difference]: Start difference. First operand 13975 states and 21560 transitions. Second operand 6 states. [2019-10-02 12:07:01,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:01,253 INFO L93 Difference]: Finished difference Result 45006 states and 71792 transitions. [2019-10-02 12:07:01,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:07:01,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 242 [2019-10-02 12:07:01,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:01,386 INFO L225 Difference]: With dead ends: 45006 [2019-10-02 12:07:01,387 INFO L226 Difference]: Without dead ends: 31177 [2019-10-02 12:07:01,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:07:01,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31177 states. [2019-10-02 12:07:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31177 to 28739. [2019-10-02 12:07:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28739 states. [2019-10-02 12:07:04,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28739 states to 28739 states and 44772 transitions. [2019-10-02 12:07:04,327 INFO L78 Accepts]: Start accepts. Automaton has 28739 states and 44772 transitions. Word has length 242 [2019-10-02 12:07:04,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:04,328 INFO L475 AbstractCegarLoop]: Abstraction has 28739 states and 44772 transitions. [2019-10-02 12:07:04,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:04,328 INFO L276 IsEmpty]: Start isEmpty. Operand 28739 states and 44772 transitions. [2019-10-02 12:07:04,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 12:07:04,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:04,336 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:07:04,336 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:04,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:04,337 INFO L82 PathProgramCache]: Analyzing trace with hash 66618518, now seen corresponding path program 1 times [2019-10-02 12:07:04,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:04,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:04,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:04,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:04,491 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:07:04,491 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:04,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:07:04,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:07:04,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:07:04,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:07:04,494 INFO L87 Difference]: Start difference. First operand 28739 states and 44772 transitions. Second operand 6 states. [2019-10-02 12:07:11,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:11,943 INFO L93 Difference]: Finished difference Result 98557 states and 159767 transitions. [2019-10-02 12:07:11,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:07:11,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 243 [2019-10-02 12:07:11,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:12,215 INFO L225 Difference]: With dead ends: 98557 [2019-10-02 12:07:12,215 INFO L226 Difference]: Without dead ends: 69996 [2019-10-02 12:07:12,285 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:07:12,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69996 states. [2019-10-02 12:07:17,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69996 to 63039. [2019-10-02 12:07:17,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63039 states. [2019-10-02 12:07:17,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63039 states to 63039 states and 99516 transitions. [2019-10-02 12:07:17,892 INFO L78 Accepts]: Start accepts. Automaton has 63039 states and 99516 transitions. Word has length 243 [2019-10-02 12:07:17,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:17,893 INFO L475 AbstractCegarLoop]: Abstraction has 63039 states and 99516 transitions. [2019-10-02 12:07:17,893 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:07:17,893 INFO L276 IsEmpty]: Start isEmpty. Operand 63039 states and 99516 transitions. [2019-10-02 12:07:17,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2019-10-02 12:07:17,903 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:17,903 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:07:17,904 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:17,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:17,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1741229003, now seen corresponding path program 1 times [2019-10-02 12:07:17,904 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:17,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:17,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:18,118 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:07:18,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:18,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:07:18,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:07:18,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:07:18,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:07:18,120 INFO L87 Difference]: Start difference. First operand 63039 states and 99516 transitions. Second operand 11 states. [2019-10-02 12:07:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:34,927 INFO L93 Difference]: Finished difference Result 212330 states and 338136 transitions. [2019-10-02 12:07:34,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:07:34,927 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 243 [2019-10-02 12:07:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:35,789 INFO L225 Difference]: With dead ends: 212330 [2019-10-02 12:07:35,790 INFO L226 Difference]: Without dead ends: 149533 [2019-10-02 12:07:35,941 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:07:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149533 states. [2019-10-02 12:07:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149533 to 146513. [2019-10-02 12:07:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146513 states. [2019-10-02 12:07:46,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146513 states to 146513 states and 229621 transitions. [2019-10-02 12:07:46,567 INFO L78 Accepts]: Start accepts. Automaton has 146513 states and 229621 transitions. Word has length 243 [2019-10-02 12:07:46,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:46,568 INFO L475 AbstractCegarLoop]: Abstraction has 146513 states and 229621 transitions. [2019-10-02 12:07:46,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:07:46,568 INFO L276 IsEmpty]: Start isEmpty. Operand 146513 states and 229621 transitions. [2019-10-02 12:07:46,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 12:07:46,577 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:46,577 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:07:46,577 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:46,577 INFO L82 PathProgramCache]: Analyzing trace with hash 519643979, now seen corresponding path program 1 times [2019-10-02 12:07:46,578 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:46,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:46,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:46,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:07:46,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:46,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:07:46,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:07:46,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:07:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:46,754 INFO L87 Difference]: Start difference. First operand 146513 states and 229621 transitions. Second operand 9 states. [2019-10-02 12:07:57,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:57,793 INFO L93 Difference]: Finished difference Result 298130 states and 467804 transitions. [2019-10-02 12:07:57,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:07:57,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 249 [2019-10-02 12:07:57,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:58,429 INFO L225 Difference]: With dead ends: 298130 [2019-10-02 12:07:58,429 INFO L226 Difference]: Without dead ends: 151859 [2019-10-02 12:07:58,737 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:58,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151859 states. [2019-10-02 12:08:12,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151859 to 149483. [2019-10-02 12:08:12,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149483 states. [2019-10-02 12:08:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149483 states to 149483 states and 233482 transitions. [2019-10-02 12:08:13,219 INFO L78 Accepts]: Start accepts. Automaton has 149483 states and 233482 transitions. Word has length 249 [2019-10-02 12:08:13,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:13,220 INFO L475 AbstractCegarLoop]: Abstraction has 149483 states and 233482 transitions. [2019-10-02 12:08:13,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:08:13,220 INFO L276 IsEmpty]: Start isEmpty. Operand 149483 states and 233482 transitions. [2019-10-02 12:08:13,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 12:08:13,229 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:13,230 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:08:13,230 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:13,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:13,230 INFO L82 PathProgramCache]: Analyzing trace with hash -601262067, now seen corresponding path program 1 times [2019-10-02 12:08:13,230 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:13,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:13,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:13,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:13,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:13,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:13,393 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:08:13,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:13,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:08:13,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:08:13,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:08:13,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:13,394 INFO L87 Difference]: Start difference. First operand 149483 states and 233482 transitions. Second operand 9 states. [2019-10-02 12:08:24,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:24,569 INFO L93 Difference]: Finished difference Result 303476 states and 474338 transitions. [2019-10-02 12:08:24,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:08:24,569 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 248 [2019-10-02 12:08:24,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:25,231 INFO L225 Difference]: With dead ends: 303476 [2019-10-02 12:08:25,231 INFO L226 Difference]: Without dead ends: 154235 [2019-10-02 12:08:25,525 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:08:25,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154235 states. [2019-10-02 12:08:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154235 to 149780. [2019-10-02 12:08:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149780 states. [2019-10-02 12:08:42,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149780 states to 149780 states and 233779 transitions. [2019-10-02 12:08:42,542 INFO L78 Accepts]: Start accepts. Automaton has 149780 states and 233779 transitions. Word has length 248 [2019-10-02 12:08:42,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:42,542 INFO L475 AbstractCegarLoop]: Abstraction has 149780 states and 233779 transitions. [2019-10-02 12:08:42,542 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:08:42,543 INFO L276 IsEmpty]: Start isEmpty. Operand 149780 states and 233779 transitions. [2019-10-02 12:08:42,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2019-10-02 12:08:42,548 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:42,549 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-02 12:08:42,549 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:42,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:42,550 INFO L82 PathProgramCache]: Analyzing trace with hash -176477879, now seen corresponding path program 1 times [2019-10-02 12:08:42,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:42,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:42,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:42,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 12:08:42,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:42,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:08:42,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:08:42,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:08:42,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:08:42,707 INFO L87 Difference]: Start difference. First operand 149780 states and 233779 transitions. Second operand 5 states. [2019-10-02 12:08:55,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:55,174 INFO L93 Difference]: Finished difference Result 300758 states and 468846 transitions. [2019-10-02 12:08:55,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:08:55,175 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 249 [2019-10-02 12:08:55,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:55,810 INFO L225 Difference]: With dead ends: 300758 [2019-10-02 12:08:55,811 INFO L226 Difference]: Without dead ends: 151220 [2019-10-02 12:08:56,500 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:08:56,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151220 states. [2019-10-02 12:09:05,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151220 to 149732. [2019-10-02 12:09:05,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149732 states. [2019-10-02 12:09:06,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149732 states to 149732 states and 233665 transitions. [2019-10-02 12:09:06,630 INFO L78 Accepts]: Start accepts. Automaton has 149732 states and 233665 transitions. Word has length 249 [2019-10-02 12:09:06,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:06,630 INFO L475 AbstractCegarLoop]: Abstraction has 149732 states and 233665 transitions. [2019-10-02 12:09:06,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:09:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 149732 states and 233665 transitions. [2019-10-02 12:09:06,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 12:09:06,637 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:06,637 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:06,637 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:06,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:06,637 INFO L82 PathProgramCache]: Analyzing trace with hash 211147335, now seen corresponding path program 1 times [2019-10-02 12:09:06,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:06,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:06,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:06,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:06,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-10-02 12:09:06,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:06,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:09:06,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:09:06,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:09:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:09:06,855 INFO L87 Difference]: Start difference. First operand 149732 states and 233665 transitions. Second operand 8 states. [2019-10-02 12:09:33,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:33,000 INFO L93 Difference]: Finished difference Result 467748 states and 745576 transitions. [2019-10-02 12:09:33,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:09:33,001 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 258 [2019-10-02 12:09:33,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:35,509 INFO L225 Difference]: With dead ends: 467748 [2019-10-02 12:09:35,509 INFO L226 Difference]: Without dead ends: 317994 [2019-10-02 12:09:35,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:09:36,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317994 states. [2019-10-02 12:10:06,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317994 to 317896. [2019-10-02 12:10:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317896 states. [2019-10-02 12:10:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317896 states to 317896 states and 500864 transitions. [2019-10-02 12:10:09,471 INFO L78 Accepts]: Start accepts. Automaton has 317896 states and 500864 transitions. Word has length 258 [2019-10-02 12:10:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:09,471 INFO L475 AbstractCegarLoop]: Abstraction has 317896 states and 500864 transitions. [2019-10-02 12:10:09,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:10:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 317896 states and 500864 transitions. [2019-10-02 12:10:09,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 12:10:09,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:09,477 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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] [2019-10-02 12:10:09,478 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:09,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:09,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1415512445, now seen corresponding path program 1 times [2019-10-02 12:10:09,478 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:09,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:09,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:09,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:09,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-10-02 12:10:09,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:10:09,647 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:10:09,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:10,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:10,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 3956 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:10:10,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:10:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-10-02 12:10:10,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:10:10,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 12:10:10,322 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:10:10,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:10:10,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:10:10,323 INFO L87 Difference]: Start difference. First operand 317896 states and 500864 transitions. Second operand 9 states. [2019-10-02 12:10:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:39,747 INFO L93 Difference]: Finished difference Result 637984 states and 1035206 transitions. [2019-10-02 12:10:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:10:39,747 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2019-10-02 12:10:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:41,207 INFO L225 Difference]: With dead ends: 637984 [2019-10-02 12:10:41,207 INFO L226 Difference]: Without dead ends: 320206 [2019-10-02 12:10:42,790 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:10:43,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320206 states. [2019-10-02 12:11:20,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320206 to 320206. [2019-10-02 12:11:20,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320206 states. [2019-10-02 12:11:22,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320206 states to 320206 states and 503834 transitions. [2019-10-02 12:11:22,654 INFO L78 Accepts]: Start accepts. Automaton has 320206 states and 503834 transitions. Word has length 258 [2019-10-02 12:11:22,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:22,654 INFO L475 AbstractCegarLoop]: Abstraction has 320206 states and 503834 transitions. [2019-10-02 12:11:22,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:11:22,655 INFO L276 IsEmpty]: Start isEmpty. Operand 320206 states and 503834 transitions. [2019-10-02 12:11:22,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-02 12:11:22,662 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:22,662 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:11:22,662 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:22,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:22,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1070674342, now seen corresponding path program 1 times [2019-10-02 12:11:22,663 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:22,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:22,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:22,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:22,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:22,809 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 12:11:22,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:22,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:11:22,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:11:22,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:11:22,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:11:22,810 INFO L87 Difference]: Start difference. First operand 320206 states and 503834 transitions. Second operand 7 states. [2019-10-02 12:11:58,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:11:58,841 INFO L93 Difference]: Finished difference Result 628164 states and 997857 transitions. [2019-10-02 12:11:58,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:11:58,842 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 261 [2019-10-02 12:11:58,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:01,361 INFO L225 Difference]: With dead ends: 628164 [2019-10-02 12:12:01,361 INFO L226 Difference]: Without dead ends: 337649 [2019-10-02 12:12:02,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:12:02,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337649 states. [2019-10-02 12:12:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337649 to 331888. [2019-10-02 12:12:33,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331888 states. [2019-10-02 12:12:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331888 states to 331888 states and 519767 transitions. [2019-10-02 12:12:35,703 INFO L78 Accepts]: Start accepts. Automaton has 331888 states and 519767 transitions. Word has length 261 [2019-10-02 12:12:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:12:35,703 INFO L475 AbstractCegarLoop]: Abstraction has 331888 states and 519767 transitions. [2019-10-02 12:12:35,704 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:12:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 331888 states and 519767 transitions. [2019-10-02 12:12:35,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-10-02 12:12:35,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:12:35,712 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 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] [2019-10-02 12:12:35,712 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:12:35,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:12:35,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1873171493, now seen corresponding path program 1 times [2019-10-02 12:12:35,712 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:12:35,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:12:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:35,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:35,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:12:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 14 proven. 15 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 12:12:36,977 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:12:36,977 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:12:37,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:12:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:12:37,651 INFO L256 TraceCheckSpWp]: Trace formula consists of 3961 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:12:37,655 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:12:37,714 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-02 12:12:37,721 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:12:37,721 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:12:37,722 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:12:37,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:12:37,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:12:37,722 INFO L87 Difference]: Start difference. First operand 331888 states and 519767 transitions. Second operand 8 states. [2019-10-02 12:13:07,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:13:07,284 INFO L93 Difference]: Finished difference Result 666793 states and 1074497 transitions. [2019-10-02 12:13:07,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:13:07,285 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 263 [2019-10-02 12:13:07,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:13:08,892 INFO L225 Difference]: With dead ends: 666793 [2019-10-02 12:13:08,893 INFO L226 Difference]: Without dead ends: 335023 [2019-10-02 12:13:10,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 266 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:13:10,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335023 states. [2019-10-02 12:13:41,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335023 to 335023. [2019-10-02 12:13:41,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335023 states. [2019-10-02 12:13:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335023 states to 335023 states and 523562 transitions. [2019-10-02 12:13:44,222 INFO L78 Accepts]: Start accepts. Automaton has 335023 states and 523562 transitions. Word has length 263 [2019-10-02 12:13:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:13:44,222 INFO L475 AbstractCegarLoop]: Abstraction has 335023 states and 523562 transitions. [2019-10-02 12:13:44,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:13:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 335023 states and 523562 transitions. [2019-10-02 12:13:44,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2019-10-02 12:13:44,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:13:44,232 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:44,233 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:13:44,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:13:44,233 INFO L82 PathProgramCache]: Analyzing trace with hash -739892504, now seen corresponding path program 1 times [2019-10-02 12:13:44,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:13:44,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:13:44,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:44,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:13:44,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:13:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:13:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 12:13:44,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:13:44,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:13:44,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:13:44,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:13:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:13:44,393 INFO L87 Difference]: Start difference. First operand 335023 states and 523562 transitions. Second operand 6 states. [2019-10-02 12:14:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:14:26,787 INFO L93 Difference]: Finished difference Result 751590 states and 1179816 transitions. [2019-10-02 12:14:26,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:14:26,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 265 [2019-10-02 12:14:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:14:28,828 INFO L225 Difference]: With dead ends: 751590 [2019-10-02 12:14:28,828 INFO L226 Difference]: Without dead ends: 446885 [2019-10-02 12:14:30,672 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:14:30,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446885 states. [2019-10-02 12:15:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446885 to 414564. [2019-10-02 12:15:04,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414564 states. [2019-10-02 12:15:08,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414564 states to 414564 states and 649687 transitions. [2019-10-02 12:15:08,226 INFO L78 Accepts]: Start accepts. Automaton has 414564 states and 649687 transitions. Word has length 265 [2019-10-02 12:15:08,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:08,227 INFO L475 AbstractCegarLoop]: Abstraction has 414564 states and 649687 transitions. [2019-10-02 12:15:08,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:08,227 INFO L276 IsEmpty]: Start isEmpty. Operand 414564 states and 649687 transitions. [2019-10-02 12:15:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2019-10-02 12:15:08,233 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:08,234 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:08,234 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:08,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:08,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1317366932, now seen corresponding path program 1 times [2019-10-02 12:15:08,234 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:08,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:08,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:08,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:08,420 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 12:15:08,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:08,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:15:08,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:15:08,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:15:08,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:08,422 INFO L87 Difference]: Start difference. First operand 414564 states and 649687 transitions. Second operand 9 states.