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_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:03:07,595 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:03:07,598 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:03:07,610 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:03:07,610 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:03:07,611 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:03:07,612 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:03:07,614 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:03:07,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:03:07,617 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:03:07,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:03:07,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:03:07,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:03:07,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:03:07,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:03:07,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:03:07,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:03:07,624 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:03:07,626 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:03:07,628 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:03:07,630 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:03:07,631 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:03:07,632 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:03:07,633 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:03:07,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:03:07,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:03:07,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:03:07,637 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:03:07,637 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:03:07,638 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:03:07,638 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:03:07,639 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:03:07,640 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:03:07,641 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:03:07,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:03:07,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:03:07,642 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:03:07,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:03:07,643 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:03:07,644 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:03:07,645 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:03:07,645 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:03:07,664 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:03:07,665 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:03:07,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:03:07,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:03:07,669 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:03:07,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:03:07,669 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:03:07,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:03:07,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:03:07,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:03:07,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:03:07,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:03:07,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:03:07,671 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:03:07,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:03:07,671 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:03:07,671 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:03:07,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:03:07,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:03:07,673 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:03:07,674 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:03:07,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:03:07,674 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:03:07,675 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:03:07,675 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:03:07,676 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:03:07,676 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:03:07,676 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:03:07,677 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:03:07,722 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:03:07,735 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:03:07,738 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:03:07,740 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:03:07,740 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:03:07,741 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product19.cil.c [2019-10-02 12:03:07,811 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bdd1139/0a365d359c6f427ea5d2e0ccdc66bafb/FLAGbcf5b73fa [2019-10-02 12:03:08,494 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:03:08,496 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product19.cil.c [2019-10-02 12:03:08,517 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bdd1139/0a365d359c6f427ea5d2e0ccdc66bafb/FLAGbcf5b73fa [2019-10-02 12:03:08,739 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/42bdd1139/0a365d359c6f427ea5d2e0ccdc66bafb [2019-10-02 12:03:08,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:03:08,751 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:03:08,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:03:08,752 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:03:08,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:03:08,758 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:03:08" (1/1) ... [2019-10-02 12:03:08,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e9ec34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:08, skipping insertion in model container [2019-10-02 12:03:08,761 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:03:08" (1/1) ... [2019-10-02 12:03:08,769 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:03:08,861 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:03:09,653 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:03:09,683 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:03:09,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:03:10,004 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:03:10,006 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10 WrapperNode [2019-10-02 12:03:10,006 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:03:10,007 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:03:10,007 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:03:10,008 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:03:10,028 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (1/1) ... [2019-10-02 12:03:10,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (1/1) ... [2019-10-02 12:03:10,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (1/1) ... [2019-10-02 12:03:10,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (1/1) ... [2019-10-02 12:03:10,171 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (1/1) ... [2019-10-02 12:03:10,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (1/1) ... [2019-10-02 12:03:10,234 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (1/1) ... [2019-10-02 12:03:10,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:03:10,249 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:03:10,249 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:03:10,249 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:03:10,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (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:03:10,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:03:10,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:03:10,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:03:10,335 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:03:10,335 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:03:10,335 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:03:10,335 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:03:10,336 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:03:10,336 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:03:10,336 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:03:10,336 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:03:10,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:03:10,337 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:03:10,337 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:03:10,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:03:10,337 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:03:10,338 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:03:10,338 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:03:10,338 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:03:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:03:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:03:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:03:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:03:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:03:10,339 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:03:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:03:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:03:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:03:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:03:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:03:10,340 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:03:10,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:03:10,341 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:03:10,341 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:03:10,341 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:03:10,342 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:03:10,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:03:10,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:03:10,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:03:10,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:03:10,343 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:03:10,343 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:03:10,343 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:03:10,343 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:03:10,343 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:03:10,343 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:03:10,344 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:03:10,344 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:03:10,344 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:03:10,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:03:10,344 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:03:10,345 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:03:10,345 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:03:10,345 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:03:10,345 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:03:10,345 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:03:10,345 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:03:10,346 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:03:10,346 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:03:10,346 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:03:10,346 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:03:10,346 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:03:10,347 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:03:10,347 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:03:10,347 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:03:10,347 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:03:10,347 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:03:10,348 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 12:03:10,348 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 12:03:10,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:03:10,348 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:03:10,348 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:03:10,348 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:03:10,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:03:10,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:03:10,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:03:10,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:03:10,350 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:03:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:03:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:03:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:03:10,350 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:03:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:03:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:03:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:03:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:03:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:03:10,351 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:03:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:03:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:03:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:03:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:03:10,352 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:03:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:03:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:03:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:03:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:03:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:03:10,353 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:03:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:03:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:03:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:03:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:03:10,354 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:03:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:03:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:03:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:03:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:03:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:03:10,355 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:03:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:03:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:03:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:03:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:03:10,356 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:03:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:03:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:03:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:03:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:03:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:03:10,357 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:03:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:03:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:03:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:03:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:03:10,358 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:03:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:03:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:03:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:03:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:03:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:03:10,359 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:03:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 12:03:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 12:03:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:03:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:03:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:03:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:03:10,360 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:03:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:03:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:03:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:03:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:03:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:03:10,361 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:03:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:03:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:03:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:03:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:03:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:03:10,362 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:03:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:03:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:03:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:03:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:03:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:03:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:03:10,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:03:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:03:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:03:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:03:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:03:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:03:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:03:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:03:10,364 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:03:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:03:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:03:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:03:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:03:10,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:03:12,693 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:03:12,694 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:03:12,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:12 BoogieIcfgContainer [2019-10-02 12:03:12,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:03:12,699 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:03:12,699 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:03:12,703 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:03:12,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:03:08" (1/3) ... [2019-10-02 12:03:12,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7a0d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:12, skipping insertion in model container [2019-10-02 12:03:12,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:03:10" (2/3) ... [2019-10-02 12:03:12,704 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c7a0d12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:03:12, skipping insertion in model container [2019-10-02 12:03:12,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:03:12" (3/3) ... [2019-10-02 12:03:12,706 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product19.cil.c [2019-10-02 12:03:12,717 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:03:12,727 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:03:12,744 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:03:12,781 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:03:12,782 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:03:12,782 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:03:12,782 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:03:12,782 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:03:12,782 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:03:12,783 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:03:12,783 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:03:12,783 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:03:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states. [2019-10-02 12:03:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:03:12,844 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:12,846 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] [2019-10-02 12:03:12,848 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:12,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:12,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1279935943, now seen corresponding path program 1 times [2019-10-02 12:03:12,857 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:12,857 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:12,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:12,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:12,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:13,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:13,659 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:03:13,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:13,662 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:03:13,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:14,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 3289 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:03:14,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:14,468 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 12:03:14,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:14,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:03:14,487 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:03:14,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:03:14,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:03:14,505 INFO L87 Difference]: Start difference. First operand 771 states. Second operand 4 states. [2019-10-02 12:03:14,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:14,676 INFO L93 Difference]: Finished difference Result 1226 states and 1977 transitions. [2019-10-02 12:03:14,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:03:14,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 12:03:14,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:14,710 INFO L225 Difference]: With dead ends: 1226 [2019-10-02 12:03:14,711 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:03:14,724 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 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:03:14,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:03:14,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:03:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:03:14,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 982 transitions. [2019-10-02 12:03:14,863 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 982 transitions. Word has length 164 [2019-10-02 12:03:14,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:14,863 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 982 transitions. [2019-10-02 12:03:14,863 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:03:14,864 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 982 transitions. [2019-10-02 12:03:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 12:03:14,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:14,878 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] [2019-10-02 12:03:14,879 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash -699423164, now seen corresponding path program 1 times [2019-10-02 12:03:14,879 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:14,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:14,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:14,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:14,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:15,171 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:03:15,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:15,172 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:03:15,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:15,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:15,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 3294 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:15,796 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:03:15,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:15,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:15,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:15,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:15,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:15,921 INFO L87 Difference]: Start difference. First operand 617 states and 982 transitions. Second operand 6 states. [2019-10-02 12:03:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:16,061 INFO L93 Difference]: Finished difference Result 1206 states and 1937 transitions. [2019-10-02 12:03:16,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:03:16,062 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-10-02 12:03:16,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:16,069 INFO L225 Difference]: With dead ends: 1206 [2019-10-02 12:03:16,077 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:03:16,080 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 167 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:03:16,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:03:16,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:03:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:03:16,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 981 transitions. [2019-10-02 12:03:16,140 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 981 transitions. Word has length 168 [2019-10-02 12:03:16,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:16,141 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 981 transitions. [2019-10-02 12:03:16,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:16,141 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 981 transitions. [2019-10-02 12:03:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 12:03:16,148 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:16,148 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] [2019-10-02 12:03:16,148 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:16,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:16,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1185296208, now seen corresponding path program 1 times [2019-10-02 12:03:16,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:16,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:16,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:16,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:16,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:16,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:16,306 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:03:16,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:16,307 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:03:16,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:16,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 3296 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:16,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:16,998 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:03:17,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:17,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:17,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:17,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:17,016 INFO L87 Difference]: Start difference. First operand 617 states and 981 transitions. Second operand 6 states. [2019-10-02 12:03:17,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:17,102 INFO L93 Difference]: Finished difference Result 1210 states and 1940 transitions. [2019-10-02 12:03:17,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:03:17,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-10-02 12:03:17,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:17,108 INFO L225 Difference]: With dead ends: 1210 [2019-10-02 12:03:17,108 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:03:17,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 169 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:03:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:03:17,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:03:17,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:03:17,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 986 transitions. [2019-10-02 12:03:17,140 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 986 transitions. Word has length 170 [2019-10-02 12:03:17,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:17,140 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 986 transitions. [2019-10-02 12:03:17,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:17,141 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 986 transitions. [2019-10-02 12:03:17,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 12:03:17,145 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:17,146 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] [2019-10-02 12:03:17,146 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:17,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:17,146 INFO L82 PathProgramCache]: Analyzing trace with hash -766305062, now seen corresponding path program 1 times [2019-10-02 12:03:17,147 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:17,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:17,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:17,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:17,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:17,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:17,280 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:03:17,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:17,281 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:03:17,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:17,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 3297 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:17,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:18,001 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:03:18,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:18,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:18,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:18,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:18,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:18,015 INFO L87 Difference]: Start difference. First operand 623 states and 986 transitions. Second operand 6 states. [2019-10-02 12:03:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:18,102 INFO L93 Difference]: Finished difference Result 1209 states and 1931 transitions. [2019-10-02 12:03:18,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:03:18,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-10-02 12:03:18,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:18,108 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 12:03:18,108 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:03:18,111 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 171 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:03:18,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:03:18,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:03:18,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:03:18,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 985 transitions. [2019-10-02 12:03:18,137 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 985 transitions. Word has length 171 [2019-10-02 12:03:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:18,137 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 985 transitions. [2019-10-02 12:03:18,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 985 transitions. [2019-10-02 12:03:18,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 12:03:18,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:18,142 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] [2019-10-02 12:03:18,143 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:18,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:18,143 INFO L82 PathProgramCache]: Analyzing trace with hash -523185676, now seen corresponding path program 1 times [2019-10-02 12:03:18,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:18,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:18,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:18,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:18,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:18,275 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:03:18,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:18,275 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:03:18,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:18,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 3298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:18,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:18,920 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 12:03:18,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:18,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:18,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:18,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:18,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:18,938 INFO L87 Difference]: Start difference. First operand 623 states and 985 transitions. Second operand 6 states. [2019-10-02 12:03:19,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:19,015 INFO L93 Difference]: Finished difference Result 1209 states and 1930 transitions. [2019-10-02 12:03:19,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:03:19,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-10-02 12:03:19,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:19,020 INFO L225 Difference]: With dead ends: 1209 [2019-10-02 12:03:19,021 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:03:19,024 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 172 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:03:19,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:03:19,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:03:19,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:03:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 984 transitions. [2019-10-02 12:03:19,047 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 984 transitions. Word has length 172 [2019-10-02 12:03:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:19,048 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 984 transitions. [2019-10-02 12:03:19,048 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 984 transitions. [2019-10-02 12:03:19,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 12:03:19,052 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:19,052 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] [2019-10-02 12:03:19,053 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:19,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1402299617, now seen corresponding path program 1 times [2019-10-02 12:03:19,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:19,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:19,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:19,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:19,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:19,184 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 12:03:19,184 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:19,184 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:03:19,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:19,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 3298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:19,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:19,802 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:19,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:19,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:03:19,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:03:19,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:03:19,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:03:19,814 INFO L87 Difference]: Start difference. First operand 623 states and 984 transitions. Second operand 6 states. [2019-10-02 12:03:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:20,196 INFO L93 Difference]: Finished difference Result 1212 states and 1935 transitions. [2019-10-02 12:03:20,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:03:20,197 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 173 [2019-10-02 12:03:20,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:20,205 INFO L225 Difference]: With dead ends: 1212 [2019-10-02 12:03:20,206 INFO L226 Difference]: Without dead ends: 623 [2019-10-02 12:03:20,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 173 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:03:20,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-10-02 12:03:20,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-10-02 12:03:20,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-10-02 12:03:20,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 978 transitions. [2019-10-02 12:03:20,244 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 978 transitions. Word has length 173 [2019-10-02 12:03:20,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:20,244 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 978 transitions. [2019-10-02 12:03:20,244 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:03:20,244 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 978 transitions. [2019-10-02 12:03:20,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 12:03:20,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:20,250 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] [2019-10-02 12:03:20,250 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:20,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:20,251 INFO L82 PathProgramCache]: Analyzing trace with hash 731420686, now seen corresponding path program 1 times [2019-10-02 12:03:20,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:20,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:20,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:20,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:20,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:20,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:03:20,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:20,464 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:03:20,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:21,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 3301 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:21,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:21,064 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:03:21,072 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:21,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-10-02 12:03:21,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:03:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:03:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:03:21,074 INFO L87 Difference]: Start difference. First operand 623 states and 978 transitions. Second operand 12 states. [2019-10-02 12:03:21,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:21,684 INFO L93 Difference]: Finished difference Result 1214 states and 1929 transitions. [2019-10-02 12:03:21,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:03:21,684 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 175 [2019-10-02 12:03:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:21,694 INFO L225 Difference]: With dead ends: 1214 [2019-10-02 12:03:21,694 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:03:21,699 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 179 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:03:21,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:03:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:03:21,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:03:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 977 transitions. [2019-10-02 12:03:21,724 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 977 transitions. Word has length 175 [2019-10-02 12:03:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:21,726 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 977 transitions. [2019-10-02 12:03:21,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:03:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 977 transitions. [2019-10-02 12:03:21,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:03:21,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:21,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:21,731 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:21,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:21,731 INFO L82 PathProgramCache]: Analyzing trace with hash -837577245, now seen corresponding path program 1 times [2019-10-02 12:03:21,731 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:21,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:21,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:21,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:21,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:03:21,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:21,897 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:03:22,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:22,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 3304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:22,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:22,673 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:03:22,690 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:22,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:03:22,691 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:22,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:22,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:22,692 INFO L87 Difference]: Start difference. First operand 626 states and 977 transitions. Second operand 8 states. [2019-10-02 12:03:22,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:22,960 INFO L93 Difference]: Finished difference Result 1238 states and 1952 transitions. [2019-10-02 12:03:22,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:22,961 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-10-02 12:03:22,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:22,966 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 12:03:22,966 INFO L226 Difference]: Without dead ends: 644 [2019-10-02 12:03:22,969 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 179 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:03:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-02 12:03:22,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 641. [2019-10-02 12:03:22,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-02 12:03:22,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 990 transitions. [2019-10-02 12:03:22,999 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 990 transitions. Word has length 178 [2019-10-02 12:03:23,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:23,000 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 990 transitions. [2019-10-02 12:03:23,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:23,000 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 990 transitions. [2019-10-02 12:03:23,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-10-02 12:03:23,005 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:23,005 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:23,006 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:23,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:23,006 INFO L82 PathProgramCache]: Analyzing trace with hash -206288541, now seen corresponding path program 1 times [2019-10-02 12:03:23,006 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:23,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:23,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:23,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:23,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:23,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:23,178 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:03:23,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:23,181 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:03:23,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:23,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:23,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 3300 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:03:23,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:23,944 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:23,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:23,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:03:23,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:03:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:03:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:23,959 INFO L87 Difference]: Start difference. First operand 641 states and 990 transitions. Second operand 14 states. [2019-10-02 12:03:24,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:24,285 INFO L93 Difference]: Finished difference Result 1228 states and 1917 transitions. [2019-10-02 12:03:24,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:03:24,286 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 178 [2019-10-02 12:03:24,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:24,291 INFO L225 Difference]: With dead ends: 1228 [2019-10-02 12:03:24,291 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:03:24,294 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 174 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:03:24,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:03:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 630. [2019-10-02 12:03:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:03:24,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 970 transitions. [2019-10-02 12:03:24,325 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 970 transitions. Word has length 178 [2019-10-02 12:03:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:24,325 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 970 transitions. [2019-10-02 12:03:24,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:03:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 970 transitions. [2019-10-02 12:03:24,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 12:03:24,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:24,330 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] [2019-10-02 12:03:24,330 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:24,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:24,331 INFO L82 PathProgramCache]: Analyzing trace with hash 351986180, now seen corresponding path program 1 times [2019-10-02 12:03:24,331 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:24,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:24,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:24,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:24,503 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:03:24,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:24,504 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:03:24,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:25,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:25,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 3307 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:25,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:25,181 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:25,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:25,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:03:25,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:25,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:25,201 INFO L87 Difference]: Start difference. First operand 630 states and 970 transitions. Second operand 8 states. [2019-10-02 12:03:25,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:25,387 INFO L93 Difference]: Finished difference Result 1210 states and 1886 transitions. [2019-10-02 12:03:25,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:25,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-10-02 12:03:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:25,393 INFO L225 Difference]: With dead ends: 1210 [2019-10-02 12:03:25,393 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:03:25,396 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 183 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:03:25,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:03:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:03:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:03:25,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 969 transitions. [2019-10-02 12:03:25,461 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 969 transitions. Word has length 181 [2019-10-02 12:03:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:25,461 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 969 transitions. [2019-10-02 12:03:25,461 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 969 transitions. [2019-10-02 12:03:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 12:03:25,466 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:25,467 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] [2019-10-02 12:03:25,467 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:25,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:25,468 INFO L82 PathProgramCache]: Analyzing trace with hash 545192689, now seen corresponding path program 1 times [2019-10-02 12:03:25,468 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:25,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:25,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:25,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:25,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:25,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:25,613 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:03:25,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:25,613 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:03:25,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:26,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:26,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 3308 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:03:26,175 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:26,217 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 12:03:26,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:26,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:03:26,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:03:26,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:03:26,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:03:26,237 INFO L87 Difference]: Start difference. First operand 630 states and 969 transitions. Second operand 8 states. [2019-10-02 12:03:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:26,426 INFO L93 Difference]: Finished difference Result 1210 states and 1885 transitions. [2019-10-02 12:03:26,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:26,426 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-10-02 12:03:26,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:26,432 INFO L225 Difference]: With dead ends: 1210 [2019-10-02 12:03:26,432 INFO L226 Difference]: Without dead ends: 630 [2019-10-02 12:03:26,435 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 184 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:03:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-02 12:03:26,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-02 12:03:26,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-02 12:03:26,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 968 transitions. [2019-10-02 12:03:26,463 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 968 transitions. Word has length 182 [2019-10-02 12:03:26,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:26,464 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 968 transitions. [2019-10-02 12:03:26,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:03:26,464 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 968 transitions. [2019-10-02 12:03:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 12:03:26,472 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:26,472 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] [2019-10-02 12:03:26,472 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:26,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:26,473 INFO L82 PathProgramCache]: Analyzing trace with hash 343509695, now seen corresponding path program 1 times [2019-10-02 12:03:26,473 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:26,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:26,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:26,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:26,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:26,720 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 12:03:26,720 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:26,721 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:03:26,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:27,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 3309 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:03:27,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:03:27,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:27,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:03:27,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:03:27,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:03:27,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:03:27,539 INFO L87 Difference]: Start difference. First operand 630 states and 968 transitions. Second operand 18 states. [2019-10-02 12:03:28,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:28,104 INFO L93 Difference]: Finished difference Result 1226 states and 1912 transitions. [2019-10-02 12:03:28,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:03:28,105 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-10-02 12:03:28,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:28,110 INFO L225 Difference]: With dead ends: 1226 [2019-10-02 12:03:28,110 INFO L226 Difference]: Without dead ends: 645 [2019-10-02 12:03:28,114 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 185 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:03:28,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-02 12:03:28,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 641. [2019-10-02 12:03:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-10-02 12:03:28,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 976 transitions. [2019-10-02 12:03:28,141 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 976 transitions. Word has length 183 [2019-10-02 12:03:28,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:28,142 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 976 transitions. [2019-10-02 12:03:28,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:03:28,142 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 976 transitions. [2019-10-02 12:03:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:03:28,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:28,147 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] [2019-10-02 12:03:28,147 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:28,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:28,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2084842551, now seen corresponding path program 1 times [2019-10-02 12:03:28,148 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:28,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:28,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:28,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:28,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:03:28,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:28,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:28,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:28,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:28,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:28,315 INFO L87 Difference]: Start difference. First operand 641 states and 976 transitions. Second operand 9 states. [2019-10-02 12:03:28,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:28,486 INFO L93 Difference]: Finished difference Result 1157 states and 1808 transitions. [2019-10-02 12:03:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:03:28,487 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-10-02 12:03:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:28,492 INFO L225 Difference]: With dead ends: 1157 [2019-10-02 12:03:28,492 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:03:28,495 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:03:28,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:03:28,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-02 12:03:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-02 12:03:28,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 971 transitions. [2019-10-02 12:03:28,527 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 971 transitions. Word has length 184 [2019-10-02 12:03:28,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:28,529 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 971 transitions. [2019-10-02 12:03:28,529 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:28,529 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 971 transitions. [2019-10-02 12:03:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-10-02 12:03:28,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:28,537 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:28,537 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2077513911, now seen corresponding path program 1 times [2019-10-02 12:03:28,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:28,538 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:28,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:28,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:28,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:28,688 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 12:03:28,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:28,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:03:28,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:03:28,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:03:28,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:03:28,690 INFO L87 Difference]: Start difference. First operand 638 states and 971 transitions. Second operand 7 states. [2019-10-02 12:03:28,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:28,784 INFO L93 Difference]: Finished difference Result 1154 states and 1803 transitions. [2019-10-02 12:03:28,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:03:28,785 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 184 [2019-10-02 12:03:28,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:28,789 INFO L225 Difference]: With dead ends: 1154 [2019-10-02 12:03:28,789 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:03:28,793 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:03:28,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:03:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2019-10-02 12:03:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-10-02 12:03:28,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 941 transitions. [2019-10-02 12:03:28,816 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 941 transitions. Word has length 184 [2019-10-02 12:03:28,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:28,817 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 941 transitions. [2019-10-02 12:03:28,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:03:28,817 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 941 transitions. [2019-10-02 12:03:28,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 12:03:28,821 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:28,822 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:28,822 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:28,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:28,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1615961084, now seen corresponding path program 1 times [2019-10-02 12:03:28,822 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:28,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:28,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:28,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:28,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:28,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:03:29,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:29,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:03:29,035 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:03:29,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:03:29,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:03:29,035 INFO L87 Difference]: Start difference. First operand 615 states and 941 transitions. Second operand 13 states. [2019-10-02 12:03:29,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:29,351 INFO L93 Difference]: Finished difference Result 1132 states and 1771 transitions. [2019-10-02 12:03:29,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:03:29,352 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-10-02 12:03:29,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:29,356 INFO L225 Difference]: With dead ends: 1132 [2019-10-02 12:03:29,356 INFO L226 Difference]: Without dead ends: 608 [2019-10-02 12:03:29,360 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:03:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-10-02 12:03:29,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 608. [2019-10-02 12:03:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 608 states. [2019-10-02 12:03:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 932 transitions. [2019-10-02 12:03:29,381 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 932 transitions. Word has length 185 [2019-10-02 12:03:29,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:29,382 INFO L475 AbstractCegarLoop]: Abstraction has 608 states and 932 transitions. [2019-10-02 12:03:29,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:03:29,382 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 932 transitions. [2019-10-02 12:03:29,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-02 12:03:29,386 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:29,386 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] [2019-10-02 12:03:29,387 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:29,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:29,387 INFO L82 PathProgramCache]: Analyzing trace with hash -782115016, now seen corresponding path program 1 times [2019-10-02 12:03:29,387 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:29,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:29,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:29,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:29,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:29,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:29,594 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 12:03:29,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:29,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:03:29,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:03:29,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:03:29,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:03:29,596 INFO L87 Difference]: Start difference. First operand 608 states and 932 transitions. Second operand 13 states. [2019-10-02 12:03:29,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:29,982 INFO L93 Difference]: Finished difference Result 1183 states and 1839 transitions. [2019-10-02 12:03:29,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:03:29,983 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-10-02 12:03:29,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:29,991 INFO L225 Difference]: With dead ends: 1183 [2019-10-02 12:03:29,991 INFO L226 Difference]: Without dead ends: 622 [2019-10-02 12:03:29,995 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:03:29,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 622 states. [2019-10-02 12:03:30,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 622 to 620. [2019-10-02 12:03:30,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:03:30,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 947 transitions. [2019-10-02 12:03:30,018 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 947 transitions. Word has length 186 [2019-10-02 12:03:30,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:30,019 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 947 transitions. [2019-10-02 12:03:30,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:03:30,020 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 947 transitions. [2019-10-02 12:03:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 12:03:30,023 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:30,023 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:30,024 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:30,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:30,024 INFO L82 PathProgramCache]: Analyzing trace with hash -994980215, now seen corresponding path program 1 times [2019-10-02 12:03:30,024 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:30,024 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:30,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:30,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:30,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:30,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:30,232 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:03:30,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:30,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:30,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:30,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:30,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:30,234 INFO L87 Difference]: Start difference. First operand 620 states and 947 transitions. Second operand 11 states. [2019-10-02 12:03:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:30,498 INFO L93 Difference]: Finished difference Result 1137 states and 1777 transitions. [2019-10-02 12:03:30,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:03:30,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-10-02 12:03:30,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:30,506 INFO L225 Difference]: With dead ends: 1137 [2019-10-02 12:03:30,506 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:03:30,514 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:03:30,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:03:30,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:03:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:03:30,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 946 transitions. [2019-10-02 12:03:30,534 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 946 transitions. Word has length 187 [2019-10-02 12:03:30,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:30,534 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 946 transitions. [2019-10-02 12:03:30,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:03:30,535 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 946 transitions. [2019-10-02 12:03:30,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-10-02 12:03:30,538 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:30,539 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] [2019-10-02 12:03:30,539 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:30,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:30,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1376254513, now seen corresponding path program 1 times [2019-10-02 12:03:30,539 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:30,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:30,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:30,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:30,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:30,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:03:30,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:30,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:30,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:30,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:30,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:30,725 INFO L87 Difference]: Start difference. First operand 620 states and 946 transitions. Second operand 11 states. [2019-10-02 12:03:30,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:30,967 INFO L93 Difference]: Finished difference Result 1183 states and 1830 transitions. [2019-10-02 12:03:30,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:03:30,968 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-10-02 12:03:30,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:30,973 INFO L225 Difference]: With dead ends: 1183 [2019-10-02 12:03:30,973 INFO L226 Difference]: Without dead ends: 617 [2019-10-02 12:03:30,976 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:03:30,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-02 12:03:30,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 617. [2019-10-02 12:03:30,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2019-10-02 12:03:30,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 938 transitions. [2019-10-02 12:03:30,994 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 938 transitions. Word has length 188 [2019-10-02 12:03:30,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:30,994 INFO L475 AbstractCegarLoop]: Abstraction has 617 states and 938 transitions. [2019-10-02 12:03:30,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:03:30,995 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 938 transitions. [2019-10-02 12:03:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-10-02 12:03:30,998 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:30,998 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] [2019-10-02 12:03:30,998 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:30,999 INFO L82 PathProgramCache]: Analyzing trace with hash -63325852, now seen corresponding path program 1 times [2019-10-02 12:03:30,999 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:30,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:31,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:31,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:31,147 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:31,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:31,148 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:03:31,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:31,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:31,698 INFO L256 TraceCheckSpWp]: Trace formula consists of 3315 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:31,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:31,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:31,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:03:31,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:31,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:31,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:31,795 INFO L87 Difference]: Start difference. First operand 617 states and 938 transitions. Second operand 9 states. [2019-10-02 12:03:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:33,065 INFO L93 Difference]: Finished difference Result 1129 states and 1789 transitions. [2019-10-02 12:03:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:03:33,066 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-10-02 12:03:33,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:33,071 INFO L225 Difference]: With dead ends: 1129 [2019-10-02 12:03:33,071 INFO L226 Difference]: Without dead ends: 621 [2019-10-02 12:03:33,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:03:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-02 12:03:33,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-10-02 12:03:33,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-02 12:03:33,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 942 transitions. [2019-10-02 12:03:33,097 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 942 transitions. Word has length 189 [2019-10-02 12:03:33,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:33,100 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 942 transitions. [2019-10-02 12:03:33,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 942 transitions. [2019-10-02 12:03:33,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:03:33,103 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:33,103 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] [2019-10-02 12:03:33,103 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:33,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:33,104 INFO L82 PathProgramCache]: Analyzing trace with hash -341143548, now seen corresponding path program 1 times [2019-10-02 12:03:33,104 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:33,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:33,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:33,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:33,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:33,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:33,264 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:33,264 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:33,265 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:03:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:33,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:33,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 3317 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:33,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:33,887 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:03:33,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:33,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:03:33,897 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:33,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:33,898 INFO L87 Difference]: Start difference. First operand 621 states and 942 transitions. Second operand 9 states. [2019-10-02 12:03:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:35,190 INFO L93 Difference]: Finished difference Result 1138 states and 1796 transitions. [2019-10-02 12:03:35,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:35,191 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-10-02 12:03:35,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:35,196 INFO L225 Difference]: With dead ends: 1138 [2019-10-02 12:03:35,196 INFO L226 Difference]: Without dead ends: 626 [2019-10-02 12:03:35,199 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-10-02 12:03:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-10-02 12:03:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-10-02 12:03:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 947 transitions. [2019-10-02 12:03:35,220 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 947 transitions. Word has length 191 [2019-10-02 12:03:35,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:35,221 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 947 transitions. [2019-10-02 12:03:35,221 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:35,221 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 947 transitions. [2019-10-02 12:03:35,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:03:35,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:35,225 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] [2019-10-02 12:03:35,225 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:35,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:35,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1951912100, now seen corresponding path program 1 times [2019-10-02 12:03:35,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:35,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:35,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:35,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:35,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:35,365 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:35,365 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:35,365 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:03:35,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:36,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:36,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 3319 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:36,050 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:36,129 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:03:36,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:36,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:03:36,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:36,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:36,137 INFO L87 Difference]: Start difference. First operand 626 states and 947 transitions. Second operand 9 states. [2019-10-02 12:03:37,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:37,399 INFO L93 Difference]: Finished difference Result 1149 states and 1805 transitions. [2019-10-02 12:03:37,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:37,399 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-10-02 12:03:37,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:37,404 INFO L225 Difference]: With dead ends: 1149 [2019-10-02 12:03:37,405 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 12:03:37,408 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:37,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 12:03:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-02 12:03:37,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 12:03:37,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 953 transitions. [2019-10-02 12:03:37,429 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 953 transitions. Word has length 193 [2019-10-02 12:03:37,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:37,430 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 953 transitions. [2019-10-02 12:03:37,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:37,430 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 953 transitions. [2019-10-02 12:03:37,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:03:37,434 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:37,434 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] [2019-10-02 12:03:37,434 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:37,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1045392196, now seen corresponding path program 1 times [2019-10-02 12:03:37,435 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:37,435 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:37,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 12:03:37,634 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:37,634 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:03:37,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:38,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:38,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 3321 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:38,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:38,237 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:03:38,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:38,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-10-02 12:03:38,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:38,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:38,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:38,245 INFO L87 Difference]: Start difference. First operand 632 states and 953 transitions. Second operand 9 states. [2019-10-02 12:03:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:39,534 INFO L93 Difference]: Finished difference Result 1162 states and 1816 transitions. [2019-10-02 12:03:39,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:03:39,537 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-10-02 12:03:39,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:39,541 INFO L225 Difference]: With dead ends: 1162 [2019-10-02 12:03:39,542 INFO L226 Difference]: Without dead ends: 639 [2019-10-02 12:03:39,543 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 194 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:39,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-10-02 12:03:39,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-10-02 12:03:39,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-10-02 12:03:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 960 transitions. [2019-10-02 12:03:39,562 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 960 transitions. Word has length 195 [2019-10-02 12:03:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:39,563 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 960 transitions. [2019-10-02 12:03:39,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 960 transitions. [2019-10-02 12:03:39,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-02 12:03:39,566 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:39,566 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] [2019-10-02 12:03:39,566 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:39,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:39,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1725880860, now seen corresponding path program 1 times [2019-10-02 12:03:39,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:39,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:39,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:39,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:39,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:39,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:39,760 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:03:39,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:39,761 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:03:39,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:40,292 INFO L256 TraceCheckSpWp]: Trace formula consists of 3323 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:03:40,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:40,375 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:03:40,382 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:40,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-10-02 12:03:40,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:03:40,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:03:40,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:40,383 INFO L87 Difference]: Start difference. First operand 639 states and 960 transitions. Second operand 14 states. [2019-10-02 12:03:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:50,562 INFO L93 Difference]: Finished difference Result 1827 states and 2858 transitions. [2019-10-02 12:03:50,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-02 12:03:50,563 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2019-10-02 12:03:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:50,570 INFO L225 Difference]: With dead ends: 1827 [2019-10-02 12:03:50,570 INFO L226 Difference]: Without dead ends: 1297 [2019-10-02 12:03:50,573 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 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:03:50,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1297 states. [2019-10-02 12:03:50,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1297 to 1241. [2019-10-02 12:03:50,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1241 states. [2019-10-02 12:03:50,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1241 states to 1241 states and 1922 transitions. [2019-10-02 12:03:50,636 INFO L78 Accepts]: Start accepts. Automaton has 1241 states and 1922 transitions. Word has length 197 [2019-10-02 12:03:50,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:50,637 INFO L475 AbstractCegarLoop]: Abstraction has 1241 states and 1922 transitions. [2019-10-02 12:03:50,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:03:50,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1241 states and 1922 transitions. [2019-10-02 12:03:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-10-02 12:03:50,643 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:50,643 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] [2019-10-02 12:03:50,643 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:50,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:50,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1187354950, now seen corresponding path program 1 times [2019-10-02 12:03:50,644 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:50,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:50,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:50,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:50,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:50,824 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:03:50,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:50,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:03:50,826 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:03:50,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:03:50,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:03:50,826 INFO L87 Difference]: Start difference. First operand 1241 states and 1922 transitions. Second operand 9 states. [2019-10-02 12:03:50,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:50,990 INFO L93 Difference]: Finished difference Result 1778 states and 2768 transitions. [2019-10-02 12:03:50,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:03:50,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-10-02 12:03:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:50,994 INFO L225 Difference]: With dead ends: 1778 [2019-10-02 12:03:50,995 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:03:51,000 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:03:51,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:03:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-02 12:03:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 12:03:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 949 transitions. [2019-10-02 12:03:51,025 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 949 transitions. Word has length 205 [2019-10-02 12:03:51,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:51,026 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 949 transitions. [2019-10-02 12:03:51,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:03:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 949 transitions. [2019-10-02 12:03:51,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-10-02 12:03:51,029 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:51,029 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] [2019-10-02 12:03:51,029 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:51,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:51,030 INFO L82 PathProgramCache]: Analyzing trace with hash 537020510, now seen corresponding path program 1 times [2019-10-02 12:03:51,030 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:51,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:51,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:51,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:51,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:51,214 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 12:03:51,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:03:51,215 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:03:51,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:51,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 3358 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:03:51,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:03:51,874 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (19)] Exception during sending of exit command (exit): Stream closed [2019-10-02 12:03:51,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:03:51,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-10-02 12:03:51,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:03:51,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:03:51,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:03:51,885 INFO L87 Difference]: Start difference. First operand 635 states and 949 transitions. Second operand 14 states. [2019-10-02 12:03:57,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:57,309 INFO L93 Difference]: Finished difference Result 1211 states and 1871 transitions. [2019-10-02 12:03:57,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:03:57,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2019-10-02 12:03:57,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:57,315 INFO L225 Difference]: With dead ends: 1211 [2019-10-02 12:03:57,315 INFO L226 Difference]: Without dead ends: 683 [2019-10-02 12:03:57,318 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:03:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-10-02 12:03:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 646. [2019-10-02 12:03:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 646 states. [2019-10-02 12:03:57,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 964 transitions. [2019-10-02 12:03:57,346 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 964 transitions. Word has length 209 [2019-10-02 12:03:57,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:03:57,346 INFO L475 AbstractCegarLoop]: Abstraction has 646 states and 964 transitions. [2019-10-02 12:03:57,346 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:03:57,346 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 964 transitions. [2019-10-02 12:03:57,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 12:03:57,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:03:57,350 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:03:57,350 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:03:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:03:57,351 INFO L82 PathProgramCache]: Analyzing trace with hash 86984210, now seen corresponding path program 1 times [2019-10-02 12:03:57,351 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:03:57,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:03:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:57,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:03:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:03:57,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:03:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 12:03:57,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:03:57,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:03:57,542 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:03:57,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:03:57,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:03:57,543 INFO L87 Difference]: Start difference. First operand 646 states and 964 transitions. Second operand 11 states. [2019-10-02 12:04:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:01,628 INFO L93 Difference]: Finished difference Result 1183 states and 1816 transitions. [2019-10-02 12:04:01,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:04:01,629 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2019-10-02 12:04:01,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:01,634 INFO L225 Difference]: With dead ends: 1183 [2019-10-02 12:04:01,634 INFO L226 Difference]: Without dead ends: 644 [2019-10-02 12:04:01,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 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:04:01,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-02 12:04:01,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 644. [2019-10-02 12:04:01,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-10-02 12:04:01,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 960 transitions. [2019-10-02 12:04:01,667 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 960 transitions. Word has length 216 [2019-10-02 12:04:01,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:01,668 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 960 transitions. [2019-10-02 12:04:01,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:01,668 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 960 transitions. [2019-10-02 12:04:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:04:01,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:01,672 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:01,672 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:01,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:01,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1717982349, now seen corresponding path program 1 times [2019-10-02 12:04:01,673 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:01,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:01,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:01,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:01,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:01,833 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:04:01,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:01,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:01,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:01,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:01,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:01,834 INFO L87 Difference]: Start difference. First operand 644 states and 960 transitions. Second operand 9 states. [2019-10-02 12:04:08,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:08,553 INFO L93 Difference]: Finished difference Result 1917 states and 2973 transitions. [2019-10-02 12:04:08,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:04:08,554 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-10-02 12:04:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:08,565 INFO L225 Difference]: With dead ends: 1917 [2019-10-02 12:04:08,565 INFO L226 Difference]: Without dead ends: 1380 [2019-10-02 12:04:08,570 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:04:08,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2019-10-02 12:04:08,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1336. [2019-10-02 12:04:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1336 states. [2019-10-02 12:04:08,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1336 states to 1336 states and 2052 transitions. [2019-10-02 12:04:08,674 INFO L78 Accepts]: Start accepts. Automaton has 1336 states and 2052 transitions. Word has length 218 [2019-10-02 12:04:08,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:08,674 INFO L475 AbstractCegarLoop]: Abstraction has 1336 states and 2052 transitions. [2019-10-02 12:04:08,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:08,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1336 states and 2052 transitions. [2019-10-02 12:04:08,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-10-02 12:04:08,682 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:08,682 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:08,683 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:08,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:08,683 INFO L82 PathProgramCache]: Analyzing trace with hash -741242040, now seen corresponding path program 1 times [2019-10-02 12:04:08,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:08,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:08,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:08,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:08,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:08,918 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:04:08,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:08,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:04:08,920 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:04:08,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:04:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:08,921 INFO L87 Difference]: Start difference. First operand 1336 states and 2052 transitions. Second operand 7 states. [2019-10-02 12:04:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:09,059 INFO L93 Difference]: Finished difference Result 2608 states and 4053 transitions. [2019-10-02 12:04:09,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:09,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-10-02 12:04:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:09,072 INFO L225 Difference]: With dead ends: 2608 [2019-10-02 12:04:09,072 INFO L226 Difference]: Without dead ends: 1379 [2019-10-02 12:04:09,078 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2019-10-02 12:04:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1357. [2019-10-02 12:04:09,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1357 states. [2019-10-02 12:04:09,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 2076 transitions. [2019-10-02 12:04:09,168 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 2076 transitions. Word has length 223 [2019-10-02 12:04:09,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:09,169 INFO L475 AbstractCegarLoop]: Abstraction has 1357 states and 2076 transitions. [2019-10-02 12:04:09,169 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:04:09,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 2076 transitions. [2019-10-02 12:04:09,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-10-02 12:04:09,175 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:09,178 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, 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:04:09,179 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:09,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1362499568, now seen corresponding path program 1 times [2019-10-02 12:04:09,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:09,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:09,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:09,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:09,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:09,540 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:04:09,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:09,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:04:09,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:09,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:09,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:09,544 INFO L87 Difference]: Start difference. First operand 1357 states and 2076 transitions. Second operand 8 states. [2019-10-02 12:04:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:13,682 INFO L93 Difference]: Finished difference Result 4233 states and 6638 transitions. [2019-10-02 12:04:13,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:13,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-10-02 12:04:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:13,700 INFO L225 Difference]: With dead ends: 4233 [2019-10-02 12:04:13,701 INFO L226 Difference]: Without dead ends: 2981 [2019-10-02 12:04:13,705 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 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:04:13,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2019-10-02 12:04:13,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2944. [2019-10-02 12:04:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-10-02 12:04:13,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4547 transitions. [2019-10-02 12:04:13,844 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4547 transitions. Word has length 227 [2019-10-02 12:04:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:13,845 INFO L475 AbstractCegarLoop]: Abstraction has 2944 states and 4547 transitions. [2019-10-02 12:04:13,845 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:13,845 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4547 transitions. [2019-10-02 12:04:13,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-02 12:04:13,849 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:13,851 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, 1, 1, 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:04:13,851 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:13,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:13,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1473790793, now seen corresponding path program 1 times [2019-10-02 12:04:13,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:13,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:13,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:13,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:13,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-10-02 12:04:14,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:14,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:14,020 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:14,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:14,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:14,021 INFO L87 Difference]: Start difference. First operand 2944 states and 4547 transitions. Second operand 9 states. [2019-10-02 12:04:14,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:14,299 INFO L93 Difference]: Finished difference Result 5705 states and 8993 transitions. [2019-10-02 12:04:14,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:14,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-10-02 12:04:14,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:14,318 INFO L225 Difference]: With dead ends: 5705 [2019-10-02 12:04:14,318 INFO L226 Difference]: Without dead ends: 2944 [2019-10-02 12:04:14,329 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:04:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2944 states. [2019-10-02 12:04:14,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2944 to 2944. [2019-10-02 12:04:14,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-10-02 12:04:14,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 4501 transitions. [2019-10-02 12:04:14,459 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 4501 transitions. Word has length 230 [2019-10-02 12:04:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:14,460 INFO L475 AbstractCegarLoop]: Abstraction has 2944 states and 4501 transitions. [2019-10-02 12:04:14,460 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 4501 transitions. [2019-10-02 12:04:14,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 12:04:14,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:14,464 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 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:04:14,464 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:14,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:14,464 INFO L82 PathProgramCache]: Analyzing trace with hash -482068595, now seen corresponding path program 1 times [2019-10-02 12:04:14,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:14,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:14,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:14,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:14,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:14,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:14,649 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 12:04:14,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:14,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:04:14,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:04:14,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:04:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:14,652 INFO L87 Difference]: Start difference. First operand 2944 states and 4501 transitions. Second operand 7 states. [2019-10-02 12:04:18,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:18,734 INFO L93 Difference]: Finished difference Result 5501 states and 8472 transitions. [2019-10-02 12:04:18,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:04:18,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-10-02 12:04:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:18,762 INFO L225 Difference]: With dead ends: 5501 [2019-10-02 12:04:18,763 INFO L226 Difference]: Without dead ends: 3127 [2019-10-02 12:04:18,773 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 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:04:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2019-10-02 12:04:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 3060. [2019-10-02 12:04:18,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3060 states. [2019-10-02 12:04:18,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3060 states to 3060 states and 4658 transitions. [2019-10-02 12:04:18,906 INFO L78 Accepts]: Start accepts. Automaton has 3060 states and 4658 transitions. Word has length 235 [2019-10-02 12:04:18,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:18,906 INFO L475 AbstractCegarLoop]: Abstraction has 3060 states and 4658 transitions. [2019-10-02 12:04:18,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:04:18,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3060 states and 4658 transitions. [2019-10-02 12:04:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:04:18,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:18,910 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 12:04:18,910 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1868442518, now seen corresponding path program 1 times [2019-10-02 12:04:18,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:18,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:18,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:18,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:18,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:19,091 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:04:19,091 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:19,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:19,092 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:19,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:19,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:19,093 INFO L87 Difference]: Start difference. First operand 3060 states and 4658 transitions. Second operand 6 states. [2019-10-02 12:04:19,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:19,324 INFO L93 Difference]: Finished difference Result 6476 states and 9932 transitions. [2019-10-02 12:04:19,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:19,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 240 [2019-10-02 12:04:19,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:19,359 INFO L225 Difference]: With dead ends: 6476 [2019-10-02 12:04:19,359 INFO L226 Difference]: Without dead ends: 3986 [2019-10-02 12:04:19,368 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:04:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3986 states. [2019-10-02 12:04:19,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3986 to 3688. [2019-10-02 12:04:19,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-10-02 12:04:19,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5616 transitions. [2019-10-02 12:04:19,532 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5616 transitions. Word has length 240 [2019-10-02 12:04:19,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:19,532 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5616 transitions. [2019-10-02 12:04:19,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:19,532 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5616 transitions. [2019-10-02 12:04:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-10-02 12:04:19,536 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:19,536 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 12:04:19,536 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1766993256, now seen corresponding path program 1 times [2019-10-02 12:04:19,537 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:19,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:19,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:19,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:19,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:19,785 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 12:04:19,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:19,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:04:19,785 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:19,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:19,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:19,786 INFO L87 Difference]: Start difference. First operand 3688 states and 5616 transitions. Second operand 8 states. [2019-10-02 12:04:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:19,896 INFO L93 Difference]: Finished difference Result 3711 states and 5645 transitions. [2019-10-02 12:04:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:19,896 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-10-02 12:04:19,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:19,915 INFO L225 Difference]: With dead ends: 3711 [2019-10-02 12:04:19,915 INFO L226 Difference]: Without dead ends: 3694 [2019-10-02 12:04:19,918 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:19,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-10-02 12:04:20,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3688. [2019-10-02 12:04:20,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-10-02 12:04:20,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5610 transitions. [2019-10-02 12:04:20,096 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5610 transitions. Word has length 240 [2019-10-02 12:04:20,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:20,097 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5610 transitions. [2019-10-02 12:04:20,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:20,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5610 transitions. [2019-10-02 12:04:20,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-02 12:04:20,101 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:20,102 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:04:20,102 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:20,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:20,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1437701728, now seen corresponding path program 1 times [2019-10-02 12:04:20,102 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:20,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:20,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:20,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:20,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:20,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 12:04:20,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:20,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:04:20,284 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:04:20,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:04:20,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:04:20,285 INFO L87 Difference]: Start difference. First operand 3688 states and 5610 transitions. Second operand 9 states. [2019-10-02 12:04:23,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:23,665 INFO L93 Difference]: Finished difference Result 7263 states and 11116 transitions. [2019-10-02 12:04:23,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:23,665 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2019-10-02 12:04:23,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:23,681 INFO L225 Difference]: With dead ends: 7263 [2019-10-02 12:04:23,681 INFO L226 Difference]: Without dead ends: 3694 [2019-10-02 12:04:23,692 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3694 states. [2019-10-02 12:04:23,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3694 to 3688. [2019-10-02 12:04:23,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3688 states. [2019-10-02 12:04:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 5604 transitions. [2019-10-02 12:04:23,884 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 5604 transitions. Word has length 258 [2019-10-02 12:04:23,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:23,884 INFO L475 AbstractCegarLoop]: Abstraction has 3688 states and 5604 transitions. [2019-10-02 12:04:23,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:04:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 5604 transitions. [2019-10-02 12:04:23,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-02 12:04:23,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:23,889 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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] [2019-10-02 12:04:23,889 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:23,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:23,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1767697878, now seen corresponding path program 1 times [2019-10-02 12:04:23,890 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:23,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:23,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:23,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-02 12:04:24,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:24,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:24,081 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:24,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:24,082 INFO L87 Difference]: Start difference. First operand 3688 states and 5604 transitions. Second operand 6 states. [2019-10-02 12:04:27,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:27,833 INFO L93 Difference]: Finished difference Result 11450 states and 17925 transitions. [2019-10-02 12:04:27,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:27,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-10-02 12:04:27,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:27,879 INFO L225 Difference]: With dead ends: 11450 [2019-10-02 12:04:27,879 INFO L226 Difference]: Without dead ends: 7881 [2019-10-02 12:04:27,892 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 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:04:27,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7881 states. [2019-10-02 12:04:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7881 to 7478. [2019-10-02 12:04:28,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7478 states. [2019-10-02 12:04:28,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7478 states to 7478 states and 11440 transitions. [2019-10-02 12:04:28,317 INFO L78 Accepts]: Start accepts. Automaton has 7478 states and 11440 transitions. Word has length 259 [2019-10-02 12:04:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:28,317 INFO L475 AbstractCegarLoop]: Abstraction has 7478 states and 11440 transitions. [2019-10-02 12:04:28,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:28,318 INFO L276 IsEmpty]: Start isEmpty. Operand 7478 states and 11440 transitions. [2019-10-02 12:04:28,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-10-02 12:04:28,323 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:28,325 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 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] [2019-10-02 12:04:28,325 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:28,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:28,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1619443625, now seen corresponding path program 1 times [2019-10-02 12:04:28,326 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:28,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:28,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:28,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:28,633 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 12:04:28,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:28,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:04:28,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:04:28,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:04:28,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:04:28,637 INFO L87 Difference]: Start difference. First operand 7478 states and 11440 transitions. Second operand 4 states. [2019-10-02 12:04:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:29,462 INFO L93 Difference]: Finished difference Result 14806 states and 22843 transitions. [2019-10-02 12:04:29,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:04:29,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-10-02 12:04:29,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:29,509 INFO L225 Difference]: With dead ends: 14806 [2019-10-02 12:04:29,509 INFO L226 Difference]: Without dead ends: 7435 [2019-10-02 12:04:29,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:04:29,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2019-10-02 12:04:29,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7435. [2019-10-02 12:04:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7435 states. [2019-10-02 12:04:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7435 states to 7435 states and 11354 transitions. [2019-10-02 12:04:29,954 INFO L78 Accepts]: Start accepts. Automaton has 7435 states and 11354 transitions. Word has length 267 [2019-10-02 12:04:29,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:29,955 INFO L475 AbstractCegarLoop]: Abstraction has 7435 states and 11354 transitions. [2019-10-02 12:04:29,955 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:04:29,955 INFO L276 IsEmpty]: Start isEmpty. Operand 7435 states and 11354 transitions. [2019-10-02 12:04:29,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 12:04:29,960 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:29,961 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 4, 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] [2019-10-02 12:04:29,961 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:29,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:29,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1336563001, now seen corresponding path program 1 times [2019-10-02 12:04:29,961 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:29,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:29,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:29,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:29,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:30,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:30,275 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 2 proven. 24 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-10-02 12:04:30,275 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:30,275 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:30,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:30,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 3524 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 12:04:30,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:30,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 12:04:30,966 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-10-02 12:04:30,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:30,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [13] total 18 [2019-10-02 12:04:30,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:04:30,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:04:30,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:30,975 INFO L87 Difference]: Start difference. First operand 7435 states and 11354 transitions. Second operand 18 states. [2019-10-02 12:04:40,260 WARN L191 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-10-02 12:04:41,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:41,495 INFO L93 Difference]: Finished difference Result 14940 states and 22832 transitions. [2019-10-02 12:04:41,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 12:04:41,495 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 268 [2019-10-02 12:04:41,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:41,530 INFO L225 Difference]: With dead ends: 14940 [2019-10-02 12:04:41,531 INFO L226 Difference]: Without dead ends: 7612 [2019-10-02 12:04:41,549 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=257, Invalid=1723, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:04:41,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7612 states. [2019-10-02 12:04:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7612 to 7545. [2019-10-02 12:04:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7545 states. [2019-10-02 12:04:41,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7545 states to 7545 states and 11444 transitions. [2019-10-02 12:04:41,947 INFO L78 Accepts]: Start accepts. Automaton has 7545 states and 11444 transitions. Word has length 268 [2019-10-02 12:04:41,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:41,948 INFO L475 AbstractCegarLoop]: Abstraction has 7545 states and 11444 transitions. [2019-10-02 12:04:41,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:04:41,949 INFO L276 IsEmpty]: Start isEmpty. Operand 7545 states and 11444 transitions. [2019-10-02 12:04:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-10-02 12:04:41,955 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:41,956 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:41,956 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:41,957 INFO L82 PathProgramCache]: Analyzing trace with hash -519368920, now seen corresponding path program 1 times [2019-10-02 12:04:41,957 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:41,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:41,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:41,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:41,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:42,220 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-10-02 12:04:42,221 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:42,221 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:42,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:42,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:42,912 INFO L256 TraceCheckSpWp]: Trace formula consists of 4338 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:42,919 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:43,110 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-10-02 12:04:43,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:43,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-02 12:04:43,120 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:43,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:43,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:43,120 INFO L87 Difference]: Start difference. First operand 7545 states and 11444 transitions. Second operand 11 states. [2019-10-02 12:04:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:52,026 INFO L93 Difference]: Finished difference Result 15921 states and 24758 transitions. [2019-10-02 12:04:52,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 12:04:52,027 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 399 [2019-10-02 12:04:52,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:52,061 INFO L225 Difference]: With dead ends: 15921 [2019-10-02 12:04:52,061 INFO L226 Difference]: Without dead ends: 8487 [2019-10-02 12:04:52,077 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 413 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-10-02 12:04:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8487 states. [2019-10-02 12:04:52,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8487 to 8061. [2019-10-02 12:04:52,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8061 states. [2019-10-02 12:04:52,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8061 states to 8061 states and 12368 transitions. [2019-10-02 12:04:52,396 INFO L78 Accepts]: Start accepts. Automaton has 8061 states and 12368 transitions. Word has length 399 [2019-10-02 12:04:52,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:52,396 INFO L475 AbstractCegarLoop]: Abstraction has 8061 states and 12368 transitions. [2019-10-02 12:04:52,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:52,396 INFO L276 IsEmpty]: Start isEmpty. Operand 8061 states and 12368 transitions. [2019-10-02 12:04:52,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-10-02 12:04:52,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:52,403 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04:52,403 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:52,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1397126011, now seen corresponding path program 1 times [2019-10-02 12:04:52,403 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:52,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:52,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:52,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:52,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:52,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:52,644 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-10-02 12:04:52,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:52,644 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:52,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:53,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:53,277 INFO L256 TraceCheckSpWp]: Trace formula consists of 3605 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 12:04:53,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:53,430 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-02 12:04:53,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:04:53,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-10-02 12:04:53,438 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-02 12:04:53,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-02 12:04:53,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:04:53,438 INFO L87 Difference]: Start difference. First operand 8061 states and 12368 transitions. Second operand 19 states. [2019-10-02 12:05:04,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:04,474 INFO L93 Difference]: Finished difference Result 24817 states and 38499 transitions. [2019-10-02 12:05:04,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-02 12:05:04,475 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 302 [2019-10-02 12:05:04,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:04,536 INFO L225 Difference]: With dead ends: 24817 [2019-10-02 12:05:04,536 INFO L226 Difference]: Without dead ends: 16873 [2019-10-02 12:05:04,555 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=777, Unknown=0, NotChecked=0, Total=930 [2019-10-02 12:05:04,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16873 states. [2019-10-02 12:05:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16873 to 16841. [2019-10-02 12:05:05,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16841 states. [2019-10-02 12:05:05,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16841 states to 16841 states and 26161 transitions. [2019-10-02 12:05:05,156 INFO L78 Accepts]: Start accepts. Automaton has 16841 states and 26161 transitions. Word has length 302 [2019-10-02 12:05:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:05,156 INFO L475 AbstractCegarLoop]: Abstraction has 16841 states and 26161 transitions. [2019-10-02 12:05:05,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-02 12:05:05,156 INFO L276 IsEmpty]: Start isEmpty. Operand 16841 states and 26161 transitions. [2019-10-02 12:05:05,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-10-02 12:05:05,163 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:05,163 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:05,163 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:05,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:05,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1426278672, now seen corresponding path program 1 times [2019-10-02 12:05:05,164 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:05,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:05,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:05,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:05,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:05,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:05,433 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-10-02 12:05:05,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:05,433 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:05,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:06,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:06,132 INFO L256 TraceCheckSpWp]: Trace formula consists of 4344 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:05:06,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:06,439 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-10-02 12:05:06,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:06,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 12:05:06,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:05:06,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:05:06,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:05:06,448 INFO L87 Difference]: Start difference. First operand 16841 states and 26161 transitions. Second operand 9 states. [2019-10-02 12:05:07,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:07,377 INFO L93 Difference]: Finished difference Result 34519 states and 54316 transitions. [2019-10-02 12:05:07,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:05:07,378 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 404 [2019-10-02 12:05:07,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:07,463 INFO L225 Difference]: With dead ends: 34519 [2019-10-02 12:05:07,464 INFO L226 Difference]: Without dead ends: 17789 [2019-10-02 12:05:07,504 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 404 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:07,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17789 states. [2019-10-02 12:05:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17789 to 17777. [2019-10-02 12:05:08,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17777 states. [2019-10-02 12:05:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17777 states to 17777 states and 27889 transitions. [2019-10-02 12:05:08,133 INFO L78 Accepts]: Start accepts. Automaton has 17777 states and 27889 transitions. Word has length 404 [2019-10-02 12:05:08,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:08,133 INFO L475 AbstractCegarLoop]: Abstraction has 17777 states and 27889 transitions. [2019-10-02 12:05:08,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:08,134 INFO L276 IsEmpty]: Start isEmpty. Operand 17777 states and 27889 transitions. [2019-10-02 12:05:08,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-10-02 12:05:08,143 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:08,143 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:08,143 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:08,144 INFO L82 PathProgramCache]: Analyzing trace with hash 2009380703, now seen corresponding path program 1 times [2019-10-02 12:05:08,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:08,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:08,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:08,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:08,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-10-02 12:05:08,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:08,395 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:08,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:10,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 4348 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-02 12:05:10,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:10,256 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-10-02 12:05:10,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:05:10,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 12:05:10,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:05:10,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:05:10,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:05:10,267 INFO L87 Difference]: Start difference. First operand 17777 states and 27889 transitions. Second operand 15 states. [2019-10-02 12:05:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:23,330 INFO L93 Difference]: Finished difference Result 57917 states and 94013 transitions. [2019-10-02 12:05:23,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 12:05:23,331 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 409 [2019-10-02 12:05:23,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:23,755 INFO L225 Difference]: With dead ends: 57917 [2019-10-02 12:05:23,755 INFO L226 Difference]: Without dead ends: 40199 [2019-10-02 12:05:23,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 509 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-10-02 12:05:23,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40199 states. [2019-10-02 12:05:24,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40199 to 39815. [2019-10-02 12:05:24,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39815 states. [2019-10-02 12:05:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39815 states to 39815 states and 63136 transitions. [2019-10-02 12:05:25,154 INFO L78 Accepts]: Start accepts. Automaton has 39815 states and 63136 transitions. Word has length 409 [2019-10-02 12:05:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:25,155 INFO L475 AbstractCegarLoop]: Abstraction has 39815 states and 63136 transitions. [2019-10-02 12:05:25,155 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:05:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 39815 states and 63136 transitions. [2019-10-02 12:05:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-10-02 12:05:25,160 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:25,160 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:05:25,160 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:25,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:25,160 INFO L82 PathProgramCache]: Analyzing trace with hash -602922725, now seen corresponding path program 1 times [2019-10-02 12:05:25,160 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:25,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:25,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:25,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:25,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 47 proven. 3 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-10-02 12:05:25,362 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:25,362 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:25,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:26,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:26,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 4072 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:05:26,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-10-02 12:05:26,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:26,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-10-02 12:05:26,434 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:05:26,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:05:26,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:05:26,434 INFO L87 Difference]: Start difference. First operand 39815 states and 63136 transitions. Second operand 8 states. [2019-10-02 12:05:29,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:29,748 INFO L93 Difference]: Finished difference Result 90479 states and 145128 transitions. [2019-10-02 12:05:29,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 12:05:29,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 387 [2019-10-02 12:05:29,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:31,877 INFO L225 Difference]: With dead ends: 90479 [2019-10-02 12:05:31,877 INFO L226 Difference]: Without dead ends: 50226 [2019-10-02 12:05:31,955 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 392 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-10-02 12:05:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50226 states. [2019-10-02 12:05:33,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50226 to 50018. [2019-10-02 12:05:33,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50018 states. [2019-10-02 12:05:33,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50018 states to 50018 states and 78689 transitions. [2019-10-02 12:05:33,641 INFO L78 Accepts]: Start accepts. Automaton has 50018 states and 78689 transitions. Word has length 387 [2019-10-02 12:05:33,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:33,642 INFO L475 AbstractCegarLoop]: Abstraction has 50018 states and 78689 transitions. [2019-10-02 12:05:33,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:05:33,642 INFO L276 IsEmpty]: Start isEmpty. Operand 50018 states and 78689 transitions. [2019-10-02 12:05:33,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-10-02 12:05:33,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:33,650 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:05:33,650 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:33,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1767070651, now seen corresponding path program 1 times [2019-10-02 12:05:33,651 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:33,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:33,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:33,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:33,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:33,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:33,975 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2019-10-02 12:05:33,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:33,976 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:34,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:34,983 INFO L256 TraceCheckSpWp]: Trace formula consists of 4075 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:05:34,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (26)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:05:35,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:35,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-10-02 12:05:35,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:05:35,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:05:35,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:05:35,107 INFO L87 Difference]: Start difference. First operand 50018 states and 78689 transitions. Second operand 13 states. [2019-10-02 12:05:52,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:52,705 INFO L93 Difference]: Finished difference Result 104538 states and 166079 transitions. [2019-10-02 12:05:52,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:05:52,705 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 390 [2019-10-02 12:05:52,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:53,014 INFO L225 Difference]: With dead ends: 104538 [2019-10-02 12:05:53,014 INFO L226 Difference]: Without dead ends: 54752 [2019-10-02 12:05:53,138 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 447 GetRequests, 413 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=1010, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:05:53,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54752 states. [2019-10-02 12:05:55,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54752 to 54424. [2019-10-02 12:05:55,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54424 states. [2019-10-02 12:05:55,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54424 states to 54424 states and 85584 transitions. [2019-10-02 12:05:55,627 INFO L78 Accepts]: Start accepts. Automaton has 54424 states and 85584 transitions. Word has length 390 [2019-10-02 12:05:55,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:55,628 INFO L475 AbstractCegarLoop]: Abstraction has 54424 states and 85584 transitions. [2019-10-02 12:05:55,628 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:05:55,628 INFO L276 IsEmpty]: Start isEmpty. Operand 54424 states and 85584 transitions. [2019-10-02 12:05:55,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2019-10-02 12:05:55,633 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:55,633 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 8, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:05:55,633 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:55,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:55,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1351491863, now seen corresponding path program 1 times [2019-10-02 12:05:55,634 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:55,634 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:55,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:55,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:55,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:55,973 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 28 proven. 18 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-10-02 12:05:55,974 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:05:55,974 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:05:56,095 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:57,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:57,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 4207 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:05:57,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:05:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-10-02 12:05:57,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:05:57,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-10-02 12:05:57,285 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:05:57,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:05:57,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:05:57,286 INFO L87 Difference]: Start difference. First operand 54424 states and 85584 transitions. Second operand 13 states. [2019-10-02 12:06:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:21,647 INFO L93 Difference]: Finished difference Result 222456 states and 359784 transitions. [2019-10-02 12:06:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:06:21,647 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 433 [2019-10-02 12:06:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:22,499 INFO L225 Difference]: With dead ends: 222456 [2019-10-02 12:06:22,499 INFO L226 Difference]: Without dead ends: 168224 [2019-10-02 12:06:22,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 450 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=189, Invalid=1001, Unknown=0, NotChecked=0, Total=1190 [2019-10-02 12:06:22,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168224 states. [2019-10-02 12:06:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168224 to 166720. [2019-10-02 12:06:32,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166720 states. [2019-10-02 12:06:33,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166720 states to 166720 states and 267451 transitions. [2019-10-02 12:06:33,329 INFO L78 Accepts]: Start accepts. Automaton has 166720 states and 267451 transitions. Word has length 433 [2019-10-02 12:06:33,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:33,330 INFO L475 AbstractCegarLoop]: Abstraction has 166720 states and 267451 transitions. [2019-10-02 12:06:33,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:06:33,330 INFO L276 IsEmpty]: Start isEmpty. Operand 166720 states and 267451 transitions. [2019-10-02 12:06:33,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2019-10-02 12:06:33,336 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:33,337 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:06:33,337 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:33,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:33,337 INFO L82 PathProgramCache]: Analyzing trace with hash 264965584, now seen corresponding path program 1 times [2019-10-02 12:06:33,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:33,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:33,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:33,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:33,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:33,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 58 proven. 6 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-10-02 12:06:34,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:06:34,300 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:06:34,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:34,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 4079 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 12:06:34,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:06:35,023 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2019-10-02 12:06:35,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:06:35,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-10-02 12:06:35,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:35,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:35,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:35,034 INFO L87 Difference]: Start difference. First operand 166720 states and 267451 transitions. Second operand 8 states. [2019-10-02 12:06:51,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:51,199 INFO L93 Difference]: Finished difference Result 429228 states and 702689 transitions. [2019-10-02 12:06:51,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-02 12:06:51,199 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 394 [2019-10-02 12:06:51,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:52,804 INFO L225 Difference]: With dead ends: 429228 [2019-10-02 12:06:52,804 INFO L226 Difference]: Without dead ends: 262158 [2019-10-02 12:06:53,989 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 419 GetRequests, 400 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2019-10-02 12:06:54,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262158 states. [2019-10-02 12:07:17,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262158 to 260930. [2019-10-02 12:07:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260930 states. [2019-10-02 12:07:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260930 states to 260930 states and 424653 transitions. [2019-10-02 12:07:19,177 INFO L78 Accepts]: Start accepts. Automaton has 260930 states and 424653 transitions. Word has length 394 [2019-10-02 12:07:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:19,178 INFO L475 AbstractCegarLoop]: Abstraction has 260930 states and 424653 transitions. [2019-10-02 12:07:19,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:19,178 INFO L276 IsEmpty]: Start isEmpty. Operand 260930 states and 424653 transitions. [2019-10-02 12:07:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2019-10-02 12:07:19,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:19,198 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 9, 7, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:07:19,198 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash 189370669, now seen corresponding path program 1 times [2019-10-02 12:07:19,199 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:19,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:19,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:19,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:19,485 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 57 proven. 17 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-02 12:07:19,486 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:07:19,486 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:07:19,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:25,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 4224 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:07:25,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:07:26,021 INFO L134 CoverageAnalysis]: Checked inductivity of 509 backedges. 51 proven. 200 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2019-10-02 12:07:26,028 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:07:26,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-10-02 12:07:26,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:07:26,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:07:26,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:07:26,030 INFO L87 Difference]: Start difference. First operand 260930 states and 424653 transitions. Second operand 10 states. [2019-10-02 12:08:08,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:08,235 INFO L93 Difference]: Finished difference Result 735380 states and 1256650 transitions. [2019-10-02 12:08:08,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-02 12:08:08,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 438 [2019-10-02 12:08:08,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:10,974 INFO L225 Difference]: With dead ends: 735380 [2019-10-02 12:08:10,974 INFO L226 Difference]: Without dead ends: 471483 [2019-10-02 12:08:12,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 488 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=238, Invalid=1022, Unknown=0, NotChecked=0, Total=1260 [2019-10-02 12:08:12,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471483 states. [2019-10-02 12:08:46,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471483 to 450083. [2019-10-02 12:08:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450083 states. [2019-10-02 12:09:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450083 states to 450083 states and 738118 transitions. [2019-10-02 12:09:01,318 INFO L78 Accepts]: Start accepts. Automaton has 450083 states and 738118 transitions. Word has length 438 [2019-10-02 12:09:01,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:01,319 INFO L475 AbstractCegarLoop]: Abstraction has 450083 states and 738118 transitions. [2019-10-02 12:09:01,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:09:01,320 INFO L276 IsEmpty]: Start isEmpty. Operand 450083 states and 738118 transitions. [2019-10-02 12:09:01,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-10-02 12:09:01,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:01,357 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 8, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:09:01,357 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:01,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:01,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1057092989, now seen corresponding path program 1 times [2019-10-02 12:09:01,358 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:01,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:01,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:01,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:01,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2019-10-02 12:09:01,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:09:01,576 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:09:01,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:02,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:02,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 4094 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:09:02,315 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:09:02,491 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 219 proven. 6 refuted. 0 times theorem prover too weak. 160 trivial. 0 not checked. [2019-10-02 12:09:02,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:09:02,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2019-10-02 12:09:02,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:09:02,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:09:02,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:09:02,507 INFO L87 Difference]: Start difference. First operand 450083 states and 738118 transitions. Second operand 8 states. [2019-10-02 12:10:13,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:13,465 INFO L93 Difference]: Finished difference Result 1099460 states and 1798228 transitions. [2019-10-02 12:10:13,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 12:10:13,466 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 399 [2019-10-02 12:10:13,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:18,027 INFO L225 Difference]: With dead ends: 1099460 [2019-10-02 12:10:18,027 INFO L226 Difference]: Without dead ends: 647795 [2019-10-02 12:10:19,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 453 GetRequests, 422 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=230, Invalid=762, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:10:20,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647795 states. [2019-10-02 12:11:23,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647795 to 632538. [2019-10-02 12:11:23,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632538 states. [2019-10-02 12:11:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632538 states to 632538 states and 1011127 transitions. [2019-10-02 12:11:45,170 INFO L78 Accepts]: Start accepts. Automaton has 632538 states and 1011127 transitions. Word has length 399 [2019-10-02 12:11:45,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:45,170 INFO L475 AbstractCegarLoop]: Abstraction has 632538 states and 1011127 transitions. [2019-10-02 12:11:45,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:11:45,171 INFO L276 IsEmpty]: Start isEmpty. Operand 632538 states and 1011127 transitions. [2019-10-02 12:11:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2019-10-02 12:11:45,198 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:45,199 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 8, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 12:11:45,200 INFO L418 AbstractCegarLoop]: === Iteration 48 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:45,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:45,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1579659810, now seen corresponding path program 1 times [2019-10-02 12:11:45,203 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:45,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:45,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:45,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:45,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:45,605 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2019-10-02 12:11:45,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:11:45,605 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:11:45,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:46,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:46,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 4197 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:11:46,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:11:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 474 backedges. 84 proven. 128 refuted. 0 times theorem prover too weak. 262 trivial. 0 not checked. [2019-10-02 12:11:46,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:11:46,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2019-10-02 12:11:46,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-02 12:11:46,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-02 12:11:46,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=340, Unknown=0, NotChecked=0, Total=380 [2019-10-02 12:11:46,533 INFO L87 Difference]: Start difference. First operand 632538 states and 1011127 transitions. Second operand 20 states.