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_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:45:31,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:45:31,008 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:45:31,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:45:31,025 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:45:31,026 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:45:31,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:45:31,032 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:45:31,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:45:31,039 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:45:31,043 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:45:31,045 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:45:31,045 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:45:31,046 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:45:31,050 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:45:31,053 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:45:31,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:45:31,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:45:31,060 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:45:31,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:45:31,069 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:45:31,070 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:45:31,071 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:45:31,072 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:45:31,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:45:31,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:45:31,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:45:31,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:45:31,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:45:31,079 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:45:31,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:45:31,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:45:31,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:45:31,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:45:31,089 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:45:31,089 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:45:31,090 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:45:31,090 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:45:31,090 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:45:31,091 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:45:31,092 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:45:31,094 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-09-08 03:45:31,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:45:31,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:45:31,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:45:31,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:45:31,121 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:45:31,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:45:31,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:45:31,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:45:31,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:45:31,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:45:31,123 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:45:31,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:45:31,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:45:31,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:45:31,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:45:31,124 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:45:31,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:45:31,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:45:31,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:45:31,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:45:31,125 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:45:31,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:45:31,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:45:31,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:45:31,126 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:45:31,126 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:45:31,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:45:31,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:45:31,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:45:31,166 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:45:31,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:45:31,187 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:45:31,189 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:45:31,189 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:45:31,192 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product11.cil.c [2019-09-08 03:45:31,275 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74083d627/93fc8d96976a4ae188bc690b00662fca/FLAGd7c8d62d7 [2019-09-08 03:45:31,955 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:45:31,956 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product11.cil.c [2019-09-08 03:45:31,976 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74083d627/93fc8d96976a4ae188bc690b00662fca/FLAGd7c8d62d7 [2019-09-08 03:45:32,162 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/74083d627/93fc8d96976a4ae188bc690b00662fca [2019-09-08 03:45:32,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:45:32,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:45:32,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:45:32,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:45:32,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:45:32,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:45:32" (1/1) ... [2019-09-08 03:45:32,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ebbcfaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:32, skipping insertion in model container [2019-09-08 03:45:32,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:45:32" (1/1) ... [2019-09-08 03:45:32,188 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:45:32,280 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:45:32,957 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:45:32,987 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:45:33,177 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:45:33,273 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:45:33,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33 WrapperNode [2019-09-08 03:45:33,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:45:33,274 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:45:33,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:45:33,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:45:33,289 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (1/1) ... [2019-09-08 03:45:33,289 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (1/1) ... [2019-09-08 03:45:33,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (1/1) ... [2019-09-08 03:45:33,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (1/1) ... [2019-09-08 03:45:33,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (1/1) ... [2019-09-08 03:45:33,421 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (1/1) ... [2019-09-08 03:45:33,433 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (1/1) ... [2019-09-08 03:45:33,451 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:45:33,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:45:33,452 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:45:33,452 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:45:33,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (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-09-08 03:45:33,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:45:33,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:45:33,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:45:33,549 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:45:33,549 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:45:33,549 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:45:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:45:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:45:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:45:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:45:33,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:45:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:45:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:45:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:45:33,551 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:45:33,552 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:45:33,552 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:45:33,552 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:45:33,552 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:45:33,552 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:45:33,553 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:45:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:45:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:45:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:45:33,554 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:45:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:45:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:45:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:45:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:45:33,555 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:45:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:45:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:45:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:45:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:45:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:45:33,556 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:45:33,557 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:45:33,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:45:33,557 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:45:33,557 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:45:33,557 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:45:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:45:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:45:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:45:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:45:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:45:33,558 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:45:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:45:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:45:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:45:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:45:33,559 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:45:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:45:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:45:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:45:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:45:33,560 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:45:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:45:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:45:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:45:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:45:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:45:33,561 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:45:33,562 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:45:33,562 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:45:33,562 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:45:33,562 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:45:33,562 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:45:33,563 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:45:33,563 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:45:33,563 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:45:33,563 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:45:33,563 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:45:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:45:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:45:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:45:33,564 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:45:33,564 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:45:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:45:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:45:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:45:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:45:33,565 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:45:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:45:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:45:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:45:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:45:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:45:33,566 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:45:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:45:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:45:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:45:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:45:33,567 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:45:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:45:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:45:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:45:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:45:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:45:33,568 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:45:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:45:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:45:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:45:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:45:33,569 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:45:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:45:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:45:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:45:33,570 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:45:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:45:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:45:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:45:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:45:33,571 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:45:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:45:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:45:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:45:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:45:33,572 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:45:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:45:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:45:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:45:33,573 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:45:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:45:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:45:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:45:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:45:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:45:33,574 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:45:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:45:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:45:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:45:33,575 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:45:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:45:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:45:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:45:33,576 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:45:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:45:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:45:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:45:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:45:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:45:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:45:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:45:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:45:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:45:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:45:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:45:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:45:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:45:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:45:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:45:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:45:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:45:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:45:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:45:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:45:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:45:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:45:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:45:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:45:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:45:33,580 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:45:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:45:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:45:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:45:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:45:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:45:33,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:45:35,999 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:45:35,999 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:45:36,001 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:45:36 BoogieIcfgContainer [2019-09-08 03:45:36,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:45:36,002 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:45:36,002 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:45:36,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:45:36,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:45:32" (1/3) ... [2019-09-08 03:45:36,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af30045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:45:36, skipping insertion in model container [2019-09-08 03:45:36,006 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:45:33" (2/3) ... [2019-09-08 03:45:36,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3af30045 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:45:36, skipping insertion in model container [2019-09-08 03:45:36,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:45:36" (3/3) ... [2019-09-08 03:45:36,009 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product11.cil.c [2019-09-08 03:45:36,019 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:45:36,028 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:45:36,045 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:45:36,081 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:45:36,081 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:45:36,081 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:45:36,081 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:45:36,082 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:45:36,082 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:45:36,082 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:45:36,082 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:45:36,082 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:45:36,133 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states. [2019-09-08 03:45:36,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 03:45:36,167 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:36,169 INFO L399 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-09-08 03:45:36,172 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:36,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash 2009729749, now seen corresponding path program 1 times [2019-09-08 03:45:36,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:36,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:36,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:36,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:36,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:36,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:45:36,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:36,830 INFO L223 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) [2019-09-08 03:45:36,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:37,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 3257 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:45:37,507 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:45:37,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:37,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:45:37,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:45:37,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:45:37,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:45:37,631 INFO L87 Difference]: Start difference. First operand 766 states. Second operand 4 states. [2019-09-08 03:45:37,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:37,847 INFO L93 Difference]: Finished difference Result 1216 states and 1967 transitions. [2019-09-08 03:45:37,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:45:37,849 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-09-08 03:45:37,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:37,886 INFO L225 Difference]: With dead ends: 1216 [2019-09-08 03:45:37,886 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:45:37,900 INFO L628 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-09-08 03:45:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:45:38,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:45:38,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:45:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 977 transitions. [2019-09-08 03:45:38,028 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 977 transitions. Word has length 164 [2019-09-08 03:45:38,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:38,029 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 977 transitions. [2019-09-08 03:45:38,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:45:38,029 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 977 transitions. [2019-09-08 03:45:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 03:45:38,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:38,044 INFO L399 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-09-08 03:45:38,044 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:38,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:38,045 INFO L82 PathProgramCache]: Analyzing trace with hash 2119485278, now seen corresponding path program 1 times [2019-09-08 03:45:38,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:38,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:38,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:38,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:38,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:38,253 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:45:38,253 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:38,253 INFO L223 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) [2019-09-08 03:45:38,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:38,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:38,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 3262 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:38,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:38,861 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:45:38,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:38,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:38,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:38,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:38,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:38,883 INFO L87 Difference]: Start difference. First operand 612 states and 977 transitions. Second operand 6 states. [2019-09-08 03:45:39,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:39,008 INFO L93 Difference]: Finished difference Result 1196 states and 1927 transitions. [2019-09-08 03:45:39,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:45:39,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 168 [2019-09-08 03:45:39,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:39,017 INFO L225 Difference]: With dead ends: 1196 [2019-09-08 03:45:39,017 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:45:39,021 INFO L628 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-09-08 03:45:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:45:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:45:39,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:45:39,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 976 transitions. [2019-09-08 03:45:39,085 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 976 transitions. Word has length 168 [2019-09-08 03:45:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:39,087 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 976 transitions. [2019-09-08 03:45:39,087 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 976 transitions. [2019-09-08 03:45:39,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 03:45:39,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:39,100 INFO L399 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-09-08 03:45:39,100 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:39,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:39,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1181326224, now seen corresponding path program 1 times [2019-09-08 03:45:39,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:39,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:39,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:39,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:39,311 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:45:39,311 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:39,312 INFO L223 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-09-08 03:45:39,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:39,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 3264 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:39,857 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:39,898 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-09-08 03:45:39,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:39,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:39,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:39,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:39,915 INFO L87 Difference]: Start difference. First operand 612 states and 976 transitions. Second operand 6 states. [2019-09-08 03:45:40,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:40,031 INFO L93 Difference]: Finished difference Result 1200 states and 1930 transitions. [2019-09-08 03:45:40,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:45:40,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 170 [2019-09-08 03:45:40,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:40,038 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 03:45:40,038 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:45:40,041 INFO L628 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-09-08 03:45:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:45:40,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:45:40,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:45:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 981 transitions. [2019-09-08 03:45:40,080 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 981 transitions. Word has length 170 [2019-09-08 03:45:40,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:40,080 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 981 transitions. [2019-09-08 03:45:40,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:40,081 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 981 transitions. [2019-09-08 03:45:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 03:45:40,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:40,089 INFO L399 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-09-08 03:45:40,089 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:40,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:40,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1277638939, now seen corresponding path program 1 times [2019-09-08 03:45:40,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:40,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:45:40,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:40,272 INFO L223 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-09-08 03:45:40,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:40,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 3265 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:40,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:45:40,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:40,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:40,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:40,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:40,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:40,904 INFO L87 Difference]: Start difference. First operand 618 states and 981 transitions. Second operand 6 states. [2019-09-08 03:45:40,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:40,993 INFO L93 Difference]: Finished difference Result 1199 states and 1921 transitions. [2019-09-08 03:45:40,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:45:40,993 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 171 [2019-09-08 03:45:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:41,008 INFO L225 Difference]: With dead ends: 1199 [2019-09-08 03:45:41,008 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:45:41,014 INFO L628 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-09-08 03:45:41,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:45:41,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:45:41,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:45:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 980 transitions. [2019-09-08 03:45:41,045 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 980 transitions. Word has length 171 [2019-09-08 03:45:41,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:41,047 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 980 transitions. [2019-09-08 03:45:41,047 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:41,047 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 980 transitions. [2019-09-08 03:45:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 03:45:41,053 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:41,053 INFO L399 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-09-08 03:45:41,053 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:41,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:41,054 INFO L82 PathProgramCache]: Analyzing trace with hash 107661556, now seen corresponding path program 1 times [2019-09-08 03:45:41,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:41,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:41,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:41,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:41,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:45:41,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:41,190 INFO L223 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) [2019-09-08 03:45:41,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:41,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:41,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 3266 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:41,722 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:41,771 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 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:45:41,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:41,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:41,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:41,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:41,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:41,792 INFO L87 Difference]: Start difference. First operand 618 states and 980 transitions. Second operand 6 states. [2019-09-08 03:45:41,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:41,892 INFO L93 Difference]: Finished difference Result 1199 states and 1920 transitions. [2019-09-08 03:45:41,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:45:41,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 172 [2019-09-08 03:45:41,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:41,898 INFO L225 Difference]: With dead ends: 1199 [2019-09-08 03:45:41,900 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:45:41,903 INFO L628 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-09-08 03:45:41,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:45:41,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:45:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:45:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 979 transitions. [2019-09-08 03:45:41,927 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 979 transitions. Word has length 172 [2019-09-08 03:45:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:41,928 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 979 transitions. [2019-09-08 03:45:41,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 979 transitions. [2019-09-08 03:45:41,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 03:45:41,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:41,934 INFO L399 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-09-08 03:45:41,934 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:41,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1662603201, now seen corresponding path program 1 times [2019-09-08 03:45:41,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:41,934 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:41,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:42,186 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:45:42,187 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:42,187 INFO L223 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) [2019-09-08 03:45:42,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:42,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:42,712 INFO L256 TraceCheckSpWp]: Trace formula consists of 3267 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:42,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:42,766 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:45:42,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:42,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2019-09-08 03:45:42,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:45:42,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:45:42,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:45:42,777 INFO L87 Difference]: Start difference. First operand 618 states and 979 transitions. Second operand 12 states. [2019-09-08 03:45:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:43,424 INFO L93 Difference]: Finished difference Result 1210 states and 1940 transitions. [2019-09-08 03:45:43,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:45:43,425 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 173 [2019-09-08 03:45:43,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:43,434 INFO L225 Difference]: With dead ends: 1210 [2019-09-08 03:45:43,434 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 03:45:43,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 177 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-09-08 03:45:43,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 03:45:43,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2019-09-08 03:45:43,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-08 03:45:43,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 984 transitions. [2019-09-08 03:45:43,499 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 984 transitions. Word has length 173 [2019-09-08 03:45:43,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:43,499 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 984 transitions. [2019-09-08 03:45:43,499 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:45:43,499 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 984 transitions. [2019-09-08 03:45:43,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:45:43,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:43,505 INFO L399 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-09-08 03:45:43,505 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:43,506 INFO L82 PathProgramCache]: Analyzing trace with hash -98031894, now seen corresponding path program 1 times [2019-09-08 03:45:43,506 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:43,506 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:43,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:43,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:43,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:43,684 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:45:43,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:43,685 INFO L223 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-09-08 03:45:43,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:44,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:44,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:44,178 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:45:44,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:44,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:45:44,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:45:44,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:45:44,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:45:44,192 INFO L87 Difference]: Start difference. First operand 625 states and 984 transitions. Second operand 6 states. [2019-09-08 03:45:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:44,481 INFO L93 Difference]: Finished difference Result 1211 states and 1928 transitions. [2019-09-08 03:45:44,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:45:44,481 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 175 [2019-09-08 03:45:44,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:44,487 INFO L225 Difference]: With dead ends: 1211 [2019-09-08 03:45:44,488 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 03:45:44,492 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 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-09-08 03:45:44,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 03:45:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-09-08 03:45:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 03:45:44,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 972 transitions. [2019-09-08 03:45:44,517 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 972 transitions. Word has length 175 [2019-09-08 03:45:44,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:44,518 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 972 transitions. [2019-09-08 03:45:44,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:45:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 972 transitions. [2019-09-08 03:45:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:45:44,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:44,524 INFO L399 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-09-08 03:45:44,524 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash -862868501, now seen corresponding path program 1 times [2019-09-08 03:45:44,524 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:44,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:44,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:44,679 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:45:44,679 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:44,679 INFO L223 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) [2019-09-08 03:45:44,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:45,174 INFO L256 TraceCheckSpWp]: Trace formula consists of 3272 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:45,180 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:45:45,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:45,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:45:45,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:45,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:45,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:45,235 INFO L87 Difference]: Start difference. First operand 621 states and 972 transitions. Second operand 8 states. [2019-09-08 03:45:45,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:45,555 INFO L93 Difference]: Finished difference Result 1228 states and 1942 transitions. [2019-09-08 03:45:45,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:45,556 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 178 [2019-09-08 03:45:45,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:45,561 INFO L225 Difference]: With dead ends: 1228 [2019-09-08 03:45:45,561 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 03:45:45,565 INFO L628 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-09-08 03:45:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 03:45:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 636. [2019-09-08 03:45:45,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-08 03:45:45,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 985 transitions. [2019-09-08 03:45:45,597 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 985 transitions. Word has length 178 [2019-09-08 03:45:45,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:45,599 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 985 transitions. [2019-09-08 03:45:45,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:45,599 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 985 transitions. [2019-09-08 03:45:45,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:45:45,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:45,605 INFO L399 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-09-08 03:45:45,605 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:45,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:45,606 INFO L82 PathProgramCache]: Analyzing trace with hash -231579797, now seen corresponding path program 1 times [2019-09-08 03:45:45,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:45,606 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:45,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:45,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:45,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:45,779 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:45:45,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:45,782 INFO L223 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) [2019-09-08 03:45:45,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:46,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:46,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 3268 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:45:46,238 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:46,374 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:45:46,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:46,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:45:46,385 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:45:46,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:45:46,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:45:46,385 INFO L87 Difference]: Start difference. First operand 636 states and 985 transitions. Second operand 14 states. [2019-09-08 03:45:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:46,731 INFO L93 Difference]: Finished difference Result 1218 states and 1907 transitions. [2019-09-08 03:45:46,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:45:46,732 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 178 [2019-09-08 03:45:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:46,736 INFO L225 Difference]: With dead ends: 1218 [2019-09-08 03:45:46,737 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 03:45:46,740 INFO L628 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-09-08 03:45:46,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 03:45:46,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 625. [2019-09-08 03:45:46,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-08 03:45:46,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 965 transitions. [2019-09-08 03:45:46,771 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 965 transitions. Word has length 178 [2019-09-08 03:45:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:46,772 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 965 transitions. [2019-09-08 03:45:46,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:45:46,772 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 965 transitions. [2019-09-08 03:45:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:45:46,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:46,779 INFO L399 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-09-08 03:45:46,779 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash 922691447, now seen corresponding path program 1 times [2019-09-08 03:45:46,780 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:46,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:46,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:46,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:46,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:47,030 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:45:47,030 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:47,031 INFO L223 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-09-08 03:45:47,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:47,574 INFO L256 TraceCheckSpWp]: Trace formula consists of 3275 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:47,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:47,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:45:47,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:47,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:45:47,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:47,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:47,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:47,651 INFO L87 Difference]: Start difference. First operand 625 states and 965 transitions. Second operand 8 states. [2019-09-08 03:45:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:47,878 INFO L93 Difference]: Finished difference Result 1200 states and 1876 transitions. [2019-09-08 03:45:47,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:47,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-09-08 03:45:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:47,884 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 03:45:47,884 INFO L226 Difference]: Without dead ends: 625 [2019-09-08 03:45:47,888 INFO L628 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-09-08 03:45:47,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-08 03:45:47,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-09-08 03:45:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-08 03:45:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 964 transitions. [2019-09-08 03:45:47,912 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 964 transitions. Word has length 181 [2019-09-08 03:45:47,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:47,912 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 964 transitions. [2019-09-08 03:45:47,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:47,913 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 964 transitions. [2019-09-08 03:45:47,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:45:47,918 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:47,919 INFO L399 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-09-08 03:45:47,919 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:47,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:47,920 INFO L82 PathProgramCache]: Analyzing trace with hash -937209397, now seen corresponding path program 1 times [2019-09-08 03:45:47,920 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:47,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:47,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:47,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:48,062 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:45:48,063 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:48,063 INFO L223 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) [2019-09-08 03:45:48,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:48,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:48,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 3276 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:45:48,546 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:48,583 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:45:48,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:48,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:45:48,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:45:48,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:45:48,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:45:48,595 INFO L87 Difference]: Start difference. First operand 625 states and 964 transitions. Second operand 8 states. [2019-09-08 03:45:48,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:48,792 INFO L93 Difference]: Finished difference Result 1200 states and 1875 transitions. [2019-09-08 03:45:48,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:48,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-08 03:45:48,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:48,824 INFO L225 Difference]: With dead ends: 1200 [2019-09-08 03:45:48,825 INFO L226 Difference]: Without dead ends: 625 [2019-09-08 03:45:48,828 INFO L628 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-09-08 03:45:48,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-08 03:45:48,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 625. [2019-09-08 03:45:48,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-08 03:45:48,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 963 transitions. [2019-09-08 03:45:48,852 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 963 transitions. Word has length 182 [2019-09-08 03:45:48,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:48,853 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 963 transitions. [2019-09-08 03:45:48,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:45:48,853 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 963 transitions. [2019-09-08 03:45:48,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 03:45:48,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:48,858 INFO L399 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-09-08 03:45:48,858 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:48,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:48,858 INFO L82 PathProgramCache]: Analyzing trace with hash -360710894, now seen corresponding path program 1 times [2019-09-08 03:45:48,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:48,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:48,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:48,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:48,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:49,109 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 03:45:49,109 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:49,110 INFO L223 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) [2019-09-08 03:45:49,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:49,537 INFO L256 TraceCheckSpWp]: Trace formula consists of 3277 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:45:49,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:49,653 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:45:49,668 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:49,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 03:45:49,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:45:49,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:45:49,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:45:49,670 INFO L87 Difference]: Start difference. First operand 625 states and 963 transitions. Second operand 18 states. [2019-09-08 03:45:50,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:50,267 INFO L93 Difference]: Finished difference Result 1216 states and 1902 transitions. [2019-09-08 03:45:50,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:45:50,268 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 183 [2019-09-08 03:45:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:50,273 INFO L225 Difference]: With dead ends: 1216 [2019-09-08 03:45:50,273 INFO L226 Difference]: Without dead ends: 640 [2019-09-08 03:45:50,277 INFO L628 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-09-08 03:45:50,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2019-09-08 03:45:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 636. [2019-09-08 03:45:50,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-09-08 03:45:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 971 transitions. [2019-09-08 03:45:50,302 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 971 transitions. Word has length 183 [2019-09-08 03:45:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:50,302 INFO L475 AbstractCegarLoop]: Abstraction has 636 states and 971 transitions. [2019-09-08 03:45:50,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:45:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 971 transitions. [2019-09-08 03:45:50,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:45:50,308 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:50,308 INFO L399 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-09-08 03:45:50,308 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:50,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:50,309 INFO L82 PathProgramCache]: Analyzing trace with hash -1347578447, now seen corresponding path program 1 times [2019-09-08 03:45:50,309 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:50,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:50,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:50,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:50,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:50,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:50,477 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:45:50,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:50,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:45:50,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:50,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:50,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:50,479 INFO L87 Difference]: Start difference. First operand 636 states and 971 transitions. Second operand 9 states. [2019-09-08 03:45:50,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:50,649 INFO L93 Difference]: Finished difference Result 1147 states and 1798 transitions. [2019-09-08 03:45:50,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:45:50,649 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-09-08 03:45:50,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:50,655 INFO L225 Difference]: With dead ends: 1147 [2019-09-08 03:45:50,656 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:45:50,659 INFO L628 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-09-08 03:45:50,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:45:50,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-08 03:45:50,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:45:50,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 966 transitions. [2019-09-08 03:45:50,693 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 966 transitions. Word has length 184 [2019-09-08 03:45:50,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:50,694 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 966 transitions. [2019-09-08 03:45:50,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:45:50,694 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 966 transitions. [2019-09-08 03:45:50,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 03:45:50,698 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:50,698 INFO L399 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] [2019-09-08 03:45:50,699 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:50,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:50,699 INFO L82 PathProgramCache]: Analyzing trace with hash 107211580, now seen corresponding path program 1 times [2019-09-08 03:45:50,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:50,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:50,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:50,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:50,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:50,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:50,892 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:45:50,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:50,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:45:50,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:45:50,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:45:50,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:45:50,895 INFO L87 Difference]: Start difference. First operand 633 states and 966 transitions. Second operand 7 states. [2019-09-08 03:45:51,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:51,000 INFO L93 Difference]: Finished difference Result 1144 states and 1793 transitions. [2019-09-08 03:45:51,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:45:51,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 185 [2019-09-08 03:45:51,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:51,006 INFO L225 Difference]: With dead ends: 1144 [2019-09-08 03:45:51,006 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:45:51,010 INFO L628 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-09-08 03:45:51,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:45:51,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-09-08 03:45:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-08 03:45:51,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 936 transitions. [2019-09-08 03:45:51,037 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 936 transitions. Word has length 185 [2019-09-08 03:45:51,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:51,037 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 936 transitions. [2019-09-08 03:45:51,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:45:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 936 transitions. [2019-09-08 03:45:51,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-09-08 03:45:51,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:51,046 INFO L399 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-09-08 03:45:51,046 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:51,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:51,047 INFO L82 PathProgramCache]: Analyzing trace with hash 377493183, now seen corresponding path program 1 times [2019-09-08 03:45:51,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:51,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:51,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:51,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:51,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:51,315 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:45:51,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:51,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:45:51,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:45:51,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:45:51,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:45:51,317 INFO L87 Difference]: Start difference. First operand 610 states and 936 transitions. Second operand 13 states. [2019-09-08 03:45:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:51,697 INFO L93 Difference]: Finished difference Result 1122 states and 1761 transitions. [2019-09-08 03:45:51,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:45:51,697 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-09-08 03:45:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:51,702 INFO L225 Difference]: With dead ends: 1122 [2019-09-08 03:45:51,702 INFO L226 Difference]: Without dead ends: 603 [2019-09-08 03:45:51,711 INFO L628 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-09-08 03:45:51,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-09-08 03:45:51,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-09-08 03:45:51,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-09-08 03:45:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 927 transitions. [2019-09-08 03:45:51,740 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 927 transitions. Word has length 185 [2019-09-08 03:45:51,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:51,741 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 927 transitions. [2019-09-08 03:45:51,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:45:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 927 transitions. [2019-09-08 03:45:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-09-08 03:45:51,749 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:51,749 INFO L399 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-09-08 03:45:51,750 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:51,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:51,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1817636718, now seen corresponding path program 1 times [2019-09-08 03:45:51,751 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:51,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:51,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:51,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:52,051 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:45:52,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:52,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:45:52,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:45:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:45:52,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:45:52,053 INFO L87 Difference]: Start difference. First operand 603 states and 927 transitions. Second operand 13 states. [2019-09-08 03:45:52,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:52,390 INFO L93 Difference]: Finished difference Result 1173 states and 1829 transitions. [2019-09-08 03:45:52,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:45:52,391 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 186 [2019-09-08 03:45:52,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:52,395 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:45:52,395 INFO L226 Difference]: Without dead ends: 617 [2019-09-08 03:45:52,399 INFO L628 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-09-08 03:45:52,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-09-08 03:45:52,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 615. [2019-09-08 03:45:52,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 03:45:52,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 942 transitions. [2019-09-08 03:45:52,430 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 942 transitions. Word has length 186 [2019-09-08 03:45:52,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:52,433 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 942 transitions. [2019-09-08 03:45:52,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:45:52,433 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 942 transitions. [2019-09-08 03:45:52,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-08 03:45:52,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:52,441 INFO L399 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-09-08 03:45:52,441 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:52,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:52,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1074843484, now seen corresponding path program 1 times [2019-09-08 03:45:52,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:52,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:52,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:52,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:52,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:45:52,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:52,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:45:52,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:45:52,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:45:52,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:45:52,682 INFO L87 Difference]: Start difference. First operand 615 states and 942 transitions. Second operand 11 states. [2019-09-08 03:45:52,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:52,982 INFO L93 Difference]: Finished difference Result 1127 states and 1767 transitions. [2019-09-08 03:45:52,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:45:52,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 187 [2019-09-08 03:45:52,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:52,990 INFO L225 Difference]: With dead ends: 1127 [2019-09-08 03:45:52,990 INFO L226 Difference]: Without dead ends: 615 [2019-09-08 03:45:53,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:45:53,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2019-09-08 03:45:53,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2019-09-08 03:45:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 615 states. [2019-09-08 03:45:53,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 941 transitions. [2019-09-08 03:45:53,031 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 941 transitions. Word has length 187 [2019-09-08 03:45:53,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:53,032 INFO L475 AbstractCegarLoop]: Abstraction has 615 states and 941 transitions. [2019-09-08 03:45:53,032 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:45:53,032 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 941 transitions. [2019-09-08 03:45:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-09-08 03:45:53,039 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:53,039 INFO L399 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-09-08 03:45:53,040 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:53,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:53,040 INFO L82 PathProgramCache]: Analyzing trace with hash 834371519, now seen corresponding path program 1 times [2019-09-08 03:45:53,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:53,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:53,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:53,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:53,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:53,349 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:45:53,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:53,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:45:53,351 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:45:53,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:45:53,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:45:53,352 INFO L87 Difference]: Start difference. First operand 615 states and 941 transitions. Second operand 11 states. [2019-09-08 03:45:53,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:53,657 INFO L93 Difference]: Finished difference Result 1173 states and 1820 transitions. [2019-09-08 03:45:53,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:45:53,657 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-09-08 03:45:53,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:53,663 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:45:53,663 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:45:53,666 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:45:53,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:45:53,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 612. [2019-09-08 03:45:53,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 612 states. [2019-09-08 03:45:53,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 612 states to 612 states and 933 transitions. [2019-09-08 03:45:53,685 INFO L78 Accepts]: Start accepts. Automaton has 612 states and 933 transitions. Word has length 188 [2019-09-08 03:45:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:53,687 INFO L475 AbstractCegarLoop]: Abstraction has 612 states and 933 transitions. [2019-09-08 03:45:53,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:45:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 612 states and 933 transitions. [2019-09-08 03:45:53,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 03:45:53,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:53,691 INFO L399 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-09-08 03:45:53,692 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:53,692 INFO L82 PathProgramCache]: Analyzing trace with hash 138024479, now seen corresponding path program 1 times [2019-09-08 03:45:53,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:53,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:53,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:53,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:53,908 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:45:53,908 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:53,908 INFO L223 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-09-08 03:45:53,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:54,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:45:54,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:45:54,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:54,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:45:54,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:54,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:54,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:54,513 INFO L87 Difference]: Start difference. First operand 612 states and 933 transitions. Second operand 9 states. [2019-09-08 03:45:55,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:55,863 INFO L93 Difference]: Finished difference Result 1119 states and 1779 transitions. [2019-09-08 03:45:55,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:45:55,864 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 189 [2019-09-08 03:45:55,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:55,869 INFO L225 Difference]: With dead ends: 1119 [2019-09-08 03:45:55,869 INFO L226 Difference]: Without dead ends: 616 [2019-09-08 03:45:55,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 187 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:45:55,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-09-08 03:45:55,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 616. [2019-09-08 03:45:55,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 616 states. [2019-09-08 03:45:55,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 937 transitions. [2019-09-08 03:45:55,894 INFO L78 Accepts]: Start accepts. Automaton has 616 states and 937 transitions. Word has length 189 [2019-09-08 03:45:55,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:55,895 INFO L475 AbstractCegarLoop]: Abstraction has 616 states and 937 transitions. [2019-09-08 03:45:55,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:45:55,895 INFO L276 IsEmpty]: Start isEmpty. Operand 616 states and 937 transitions. [2019-09-08 03:45:55,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 03:45:55,899 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:55,900 INFO L399 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-09-08 03:45:55,900 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:55,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:55,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1103194685, now seen corresponding path program 1 times [2019-09-08 03:45:55,901 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:55,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:55,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:55,902 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:55,902 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:56,064 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:45:56,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:56,065 INFO L223 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) [2019-09-08 03:45:56,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:56,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:56,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 3285 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:45:56,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:56,610 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:45:56,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:56,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:45:56,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:56,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:56,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:56,621 INFO L87 Difference]: Start difference. First operand 616 states and 937 transitions. Second operand 9 states. [2019-09-08 03:45:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:57,929 INFO L93 Difference]: Finished difference Result 1128 states and 1786 transitions. [2019-09-08 03:45:57,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:45:57,930 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 191 [2019-09-08 03:45:57,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:57,935 INFO L225 Difference]: With dead ends: 1128 [2019-09-08 03:45:57,935 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 03:45:57,938 INFO L628 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-09-08 03:45:57,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 03:45:57,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-09-08 03:45:57,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 03:45:57,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 942 transitions. [2019-09-08 03:45:57,959 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 942 transitions. Word has length 191 [2019-09-08 03:45:57,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:57,960 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 942 transitions. [2019-09-08 03:45:57,960 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:45:57,960 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 942 transitions. [2019-09-08 03:45:57,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:45:57,965 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:57,965 INFO L399 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-09-08 03:45:57,966 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:57,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:57,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1039013023, now seen corresponding path program 1 times [2019-09-08 03:45:57,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:57,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:57,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:57,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:58,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:58,122 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:45:58,123 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:45:58,123 INFO L223 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) [2019-09-08 03:45:58,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:45:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:58,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 3287 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:45:58,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:45:58,829 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:45:58,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:45:58,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:45:58,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:58,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:58,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:58,840 INFO L87 Difference]: Start difference. First operand 621 states and 942 transitions. Second operand 9 states. [2019-09-08 03:46:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:00,064 INFO L93 Difference]: Finished difference Result 1139 states and 1795 transitions. [2019-09-08 03:46:00,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:46:00,065 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-09-08 03:46:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:00,070 INFO L225 Difference]: With dead ends: 1139 [2019-09-08 03:46:00,071 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 03:46:00,074 INFO L628 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-09-08 03:46:00,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 03:46:00,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-09-08 03:46:00,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 03:46:00,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 948 transitions. [2019-09-08 03:46:00,095 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 948 transitions. Word has length 193 [2019-09-08 03:46:00,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:00,096 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 948 transitions. [2019-09-08 03:46:00,096 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 948 transitions. [2019-09-08 03:46:00,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-09-08 03:46:00,101 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:00,102 INFO L399 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-09-08 03:46:00,102 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:00,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:00,102 INFO L82 PathProgramCache]: Analyzing trace with hash 446068923, now seen corresponding path program 1 times [2019-09-08 03:46:00,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:00,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:00,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:00,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:00,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:00,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:00,239 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:46:00,240 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:00,240 INFO L223 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-09-08 03:46:00,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:00,768 INFO L256 TraceCheckSpWp]: Trace formula consists of 3289 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:46:00,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:46:00,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:00,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-09-08 03:46:00,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:00,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:00,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:00,837 INFO L87 Difference]: Start difference. First operand 627 states and 948 transitions. Second operand 9 states. [2019-09-08 03:46:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:01,996 INFO L93 Difference]: Finished difference Result 1152 states and 1806 transitions. [2019-09-08 03:46:01,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:46:01,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-09-08 03:46:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:02,003 INFO L225 Difference]: With dead ends: 1152 [2019-09-08 03:46:02,003 INFO L226 Difference]: Without dead ends: 634 [2019-09-08 03:46:02,006 INFO L628 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-09-08 03:46:02,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-09-08 03:46:02,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2019-09-08 03:46:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-09-08 03:46:02,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 955 transitions. [2019-09-08 03:46:02,025 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 955 transitions. Word has length 195 [2019-09-08 03:46:02,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:02,026 INFO L475 AbstractCegarLoop]: Abstraction has 634 states and 955 transitions. [2019-09-08 03:46:02,026 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 955 transitions. [2019-09-08 03:46:02,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-09-08 03:46:02,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:02,030 INFO L399 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-09-08 03:46:02,030 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:02,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:02,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1735732961, now seen corresponding path program 1 times [2019-09-08 03:46:02,031 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:02,031 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:02,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:02,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:02,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:02,225 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:46:02,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:02,225 INFO L223 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-09-08 03:46:02,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:02,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:02,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:46:02,772 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:02,884 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 03:46:02,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:02,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:46:02,894 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:46:02,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:46:02,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:46:02,895 INFO L87 Difference]: Start difference. First operand 634 states and 955 transitions. Second operand 14 states. [2019-09-08 03:46:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:14,310 INFO L93 Difference]: Finished difference Result 1812 states and 2843 transitions. [2019-09-08 03:46:14,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 03:46:14,310 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 197 [2019-09-08 03:46:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:14,322 INFO L225 Difference]: With dead ends: 1812 [2019-09-08 03:46:14,322 INFO L226 Difference]: Without dead ends: 1287 [2019-09-08 03:46:14,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 215 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 03:46:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-09-08 03:46:14,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1231. [2019-09-08 03:46:14,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-09-08 03:46:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1912 transitions. [2019-09-08 03:46:14,376 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1912 transitions. Word has length 197 [2019-09-08 03:46:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:14,377 INFO L475 AbstractCegarLoop]: Abstraction has 1231 states and 1912 transitions. [2019-09-08 03:46:14,377 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:46:14,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1912 transitions. [2019-09-08 03:46:14,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-09-08 03:46:14,383 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:14,383 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:46:14,384 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:14,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:14,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1137564396, now seen corresponding path program 1 times [2019-09-08 03:46:14,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:14,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:14,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:14,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:14,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:14,548 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:46:14,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:14,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:46:14,549 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:14,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:14,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:14,550 INFO L87 Difference]: Start difference. First operand 1231 states and 1912 transitions. Second operand 9 states. [2019-09-08 03:46:14,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:14,723 INFO L93 Difference]: Finished difference Result 1763 states and 2753 transitions. [2019-09-08 03:46:14,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:46:14,724 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 205 [2019-09-08 03:46:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:14,728 INFO L225 Difference]: With dead ends: 1763 [2019-09-08 03:46:14,729 INFO L226 Difference]: Without dead ends: 630 [2019-09-08 03:46:14,734 INFO L628 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-09-08 03:46:14,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-09-08 03:46:14,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-09-08 03:46:14,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-09-08 03:46:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 944 transitions. [2019-09-08 03:46:14,758 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 944 transitions. Word has length 205 [2019-09-08 03:46:14,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:14,759 INFO L475 AbstractCegarLoop]: Abstraction has 630 states and 944 transitions. [2019-09-08 03:46:14,759 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:14,759 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 944 transitions. [2019-09-08 03:46:14,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 03:46:14,764 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:14,764 INFO L399 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-09-08 03:46:14,765 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:14,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:14,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2054421205, now seen corresponding path program 1 times [2019-09-08 03:46:14,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:14,765 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:14,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:14,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:14,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:14,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-09-08 03:46:14,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:14,973 INFO L223 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) [2019-09-08 03:46:15,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:46:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:15,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 3326 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:46:15,518 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:15,608 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:46:15,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:46:15,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 03:46:15,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:46:15,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:46:15,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:46:15,621 INFO L87 Difference]: Start difference. First operand 630 states and 944 transitions. Second operand 14 states. [2019-09-08 03:46:21,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:21,107 INFO L93 Difference]: Finished difference Result 1201 states and 1861 transitions. [2019-09-08 03:46:21,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:46:21,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 209 [2019-09-08 03:46:21,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:21,113 INFO L225 Difference]: With dead ends: 1201 [2019-09-08 03:46:21,113 INFO L226 Difference]: Without dead ends: 678 [2019-09-08 03:46:21,116 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:46:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-09-08 03:46:21,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 641. [2019-09-08 03:46:21,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 03:46:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 959 transitions. [2019-09-08 03:46:21,141 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 959 transitions. Word has length 209 [2019-09-08 03:46:21,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:21,142 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 959 transitions. [2019-09-08 03:46:21,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:46:21,142 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 959 transitions. [2019-09-08 03:46:21,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-09-08 03:46:21,146 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:21,147 INFO L399 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-09-08 03:46:21,147 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:21,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1361207174, now seen corresponding path program 1 times [2019-09-08 03:46:21,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:21,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:21,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:21,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:21,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:21,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:21,337 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:46:21,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:21,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:46:21,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:46:21,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:46:21,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:46:21,339 INFO L87 Difference]: Start difference. First operand 641 states and 959 transitions. Second operand 11 states. [2019-09-08 03:46:25,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:25,663 INFO L93 Difference]: Finished difference Result 1173 states and 1806 transitions. [2019-09-08 03:46:25,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:46:25,664 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 216 [2019-09-08 03:46:25,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:25,669 INFO L225 Difference]: With dead ends: 1173 [2019-09-08 03:46:25,669 INFO L226 Difference]: Without dead ends: 639 [2019-09-08 03:46:25,672 INFO L628 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-09-08 03:46:25,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2019-09-08 03:46:25,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2019-09-08 03:46:25,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 639 states. [2019-09-08 03:46:25,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 955 transitions. [2019-09-08 03:46:25,698 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 955 transitions. Word has length 216 [2019-09-08 03:46:25,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:25,699 INFO L475 AbstractCegarLoop]: Abstraction has 639 states and 955 transitions. [2019-09-08 03:46:25,699 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:46:25,699 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 955 transitions. [2019-09-08 03:46:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-09-08 03:46:25,702 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:25,703 INFO L399 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-09-08 03:46:25,703 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:25,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1940586207, now seen corresponding path program 1 times [2019-09-08 03:46:25,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:25,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:25,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:25,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:25,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:25,881 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:46:25,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:25,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:46:25,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:25,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:25,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:25,884 INFO L87 Difference]: Start difference. First operand 639 states and 955 transitions. Second operand 9 states. [2019-09-08 03:46:31,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:31,526 INFO L93 Difference]: Finished difference Result 1902 states and 2958 transitions. [2019-09-08 03:46:31,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:46:31,527 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-09-08 03:46:31,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:31,535 INFO L225 Difference]: With dead ends: 1902 [2019-09-08 03:46:31,535 INFO L226 Difference]: Without dead ends: 1370 [2019-09-08 03:46:31,537 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:46:31,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2019-09-08 03:46:31,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1326. [2019-09-08 03:46:31,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-09-08 03:46:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2042 transitions. [2019-09-08 03:46:31,600 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2042 transitions. Word has length 218 [2019-09-08 03:46:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:31,601 INFO L475 AbstractCegarLoop]: Abstraction has 1326 states and 2042 transitions. [2019-09-08 03:46:31,601 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2042 transitions. [2019-09-08 03:46:31,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 03:46:31,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:31,606 INFO L399 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-09-08 03:46:31,606 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:31,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:31,606 INFO L82 PathProgramCache]: Analyzing trace with hash -502763883, now seen corresponding path program 1 times [2019-09-08 03:46:31,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:31,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:31,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:31,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:31,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:46:31,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:31,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:46:31,742 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:46:31,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:46:31,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:46:31,743 INFO L87 Difference]: Start difference. First operand 1326 states and 2042 transitions. Second operand 7 states. [2019-09-08 03:46:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:31,844 INFO L93 Difference]: Finished difference Result 2588 states and 4033 transitions. [2019-09-08 03:46:31,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:46:31,845 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 223 [2019-09-08 03:46:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:31,856 INFO L225 Difference]: With dead ends: 2588 [2019-09-08 03:46:31,856 INFO L226 Difference]: Without dead ends: 1369 [2019-09-08 03:46:31,861 INFO L628 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-09-08 03:46:31,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2019-09-08 03:46:31,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1347. [2019-09-08 03:46:31,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2019-09-08 03:46:31,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 2066 transitions. [2019-09-08 03:46:31,940 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 2066 transitions. Word has length 223 [2019-09-08 03:46:31,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:31,941 INFO L475 AbstractCegarLoop]: Abstraction has 1347 states and 2066 transitions. [2019-09-08 03:46:31,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:46:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 2066 transitions. [2019-09-08 03:46:31,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 03:46:31,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:31,945 INFO L399 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-09-08 03:46:31,945 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:31,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2131868925, now seen corresponding path program 1 times [2019-09-08 03:46:31,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:31,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:31,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:31,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:31,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:31,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:32,265 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:46:32,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:32,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:46:32,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:46:32,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:46:32,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:46:32,267 INFO L87 Difference]: Start difference. First operand 1347 states and 2066 transitions. Second operand 8 states. [2019-09-08 03:46:36,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:36,410 INFO L93 Difference]: Finished difference Result 4198 states and 6603 transitions. [2019-09-08 03:46:36,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:46:36,411 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 227 [2019-09-08 03:46:36,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:36,429 INFO L225 Difference]: With dead ends: 4198 [2019-09-08 03:46:36,429 INFO L226 Difference]: Without dead ends: 2956 [2019-09-08 03:46:36,434 INFO L628 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-09-08 03:46:36,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2019-09-08 03:46:36,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2919. [2019-09-08 03:46:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2019-09-08 03:46:36,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4522 transitions. [2019-09-08 03:46:36,570 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4522 transitions. Word has length 227 [2019-09-08 03:46:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:36,571 INFO L475 AbstractCegarLoop]: Abstraction has 2919 states and 4522 transitions. [2019-09-08 03:46:36,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:46:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4522 transitions. [2019-09-08 03:46:36,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 03:46:36,574 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:36,575 INFO L399 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-09-08 03:46:36,575 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:36,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:36,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1585475037, now seen corresponding path program 1 times [2019-09-08 03:46:36,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:36,576 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:36,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:36,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:36,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:36,762 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-09-08 03:46:36,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:36,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:46:36,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:36,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:36,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:36,764 INFO L87 Difference]: Start difference. First operand 2919 states and 4522 transitions. Second operand 9 states. [2019-09-08 03:46:37,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:37,124 INFO L93 Difference]: Finished difference Result 5660 states and 8948 transitions. [2019-09-08 03:46:37,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:46:37,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 230 [2019-09-08 03:46:37,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:37,144 INFO L225 Difference]: With dead ends: 5660 [2019-09-08 03:46:37,144 INFO L226 Difference]: Without dead ends: 2919 [2019-09-08 03:46:37,155 INFO L628 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-09-08 03:46:37,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2919 states. [2019-09-08 03:46:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2919 to 2919. [2019-09-08 03:46:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2919 states. [2019-09-08 03:46:37,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2919 states to 2919 states and 4476 transitions. [2019-09-08 03:46:37,282 INFO L78 Accepts]: Start accepts. Automaton has 2919 states and 4476 transitions. Word has length 230 [2019-09-08 03:46:37,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:37,282 INFO L475 AbstractCegarLoop]: Abstraction has 2919 states and 4476 transitions. [2019-09-08 03:46:37,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:37,283 INFO L276 IsEmpty]: Start isEmpty. Operand 2919 states and 4476 transitions. [2019-09-08 03:46:37,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-09-08 03:46:37,286 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:37,287 INFO L399 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-09-08 03:46:37,287 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:37,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:37,287 INFO L82 PathProgramCache]: Analyzing trace with hash 770197530, now seen corresponding path program 1 times [2019-09-08 03:46:37,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:37,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:37,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:37,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:37,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:37,458 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-09-08 03:46:37,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:37,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:46:37,460 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:46:37,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:46:37,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:46:37,460 INFO L87 Difference]: Start difference. First operand 2919 states and 4476 transitions. Second operand 7 states. [2019-09-08 03:46:41,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:41,712 INFO L93 Difference]: Finished difference Result 5456 states and 8427 transitions. [2019-09-08 03:46:41,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:46:41,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 235 [2019-09-08 03:46:41,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:41,733 INFO L225 Difference]: With dead ends: 5456 [2019-09-08 03:46:41,734 INFO L226 Difference]: Without dead ends: 3102 [2019-09-08 03:46:41,745 INFO L628 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-09-08 03:46:41,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3102 states. [2019-09-08 03:46:41,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3102 to 3035. [2019-09-08 03:46:41,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-09-08 03:46:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4633 transitions. [2019-09-08 03:46:41,953 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4633 transitions. Word has length 235 [2019-09-08 03:46:41,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:41,954 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 4633 transitions. [2019-09-08 03:46:41,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:46:41,954 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4633 transitions. [2019-09-08 03:46:41,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 03:46:41,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:41,957 INFO L399 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-09-08 03:46:41,957 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:41,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash 670543760, now seen corresponding path program 1 times [2019-09-08 03:46:41,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:41,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:41,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:41,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:41,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:42,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:42,146 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-09-08 03:46:42,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:42,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:46:42,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:46:42,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:46:42,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:46:42,148 INFO L87 Difference]: Start difference. First operand 3035 states and 4633 transitions. Second operand 8 states. [2019-09-08 03:46:42,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:42,276 INFO L93 Difference]: Finished difference Result 3058 states and 4662 transitions. [2019-09-08 03:46:42,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:46:42,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 240 [2019-09-08 03:46:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:42,296 INFO L225 Difference]: With dead ends: 3058 [2019-09-08 03:46:42,297 INFO L226 Difference]: Without dead ends: 3041 [2019-09-08 03:46:42,300 INFO L628 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-09-08 03:46:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2019-09-08 03:46:42,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 3035. [2019-09-08 03:46:42,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-09-08 03:46:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4628 transitions. [2019-09-08 03:46:42,472 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4628 transitions. Word has length 240 [2019-09-08 03:46:42,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:42,473 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 4628 transitions. [2019-09-08 03:46:42,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:46:42,473 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4628 transitions. [2019-09-08 03:46:42,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-09-08 03:46:42,477 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:42,478 INFO L399 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-09-08 03:46:42,478 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:42,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:42,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1491797122, now seen corresponding path program 1 times [2019-09-08 03:46:42,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:42,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:42,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:42,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:42,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:42,748 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-08 03:46:42,748 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:42,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:46:42,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:46:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:46:42,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:46:42,750 INFO L87 Difference]: Start difference. First operand 3035 states and 4628 transitions. Second operand 9 states. [2019-09-08 03:46:46,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:46,242 INFO L93 Difference]: Finished difference Result 5955 states and 9146 transitions. [2019-09-08 03:46:46,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:46:46,242 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 258 [2019-09-08 03:46:46,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:46,257 INFO L225 Difference]: With dead ends: 5955 [2019-09-08 03:46:46,257 INFO L226 Difference]: Without dead ends: 3039 [2019-09-08 03:46:46,266 INFO L628 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-09-08 03:46:46,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2019-09-08 03:46:46,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 3035. [2019-09-08 03:46:46,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3035 states. [2019-09-08 03:46:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3035 states to 3035 states and 4623 transitions. [2019-09-08 03:46:46,387 INFO L78 Accepts]: Start accepts. Automaton has 3035 states and 4623 transitions. Word has length 258 [2019-09-08 03:46:46,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:46,388 INFO L475 AbstractCegarLoop]: Abstraction has 3035 states and 4623 transitions. [2019-09-08 03:46:46,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:46:46,388 INFO L276 IsEmpty]: Start isEmpty. Operand 3035 states and 4623 transitions. [2019-09-08 03:46:46,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-09-08 03:46:46,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:46,392 INFO L399 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-09-08 03:46:46,393 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:46,393 INFO L82 PathProgramCache]: Analyzing trace with hash -1627955149, now seen corresponding path program 1 times [2019-09-08 03:46:46,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:46,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:46,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:46,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:46,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:46,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-09-08 03:46:46,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:46,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:46:46,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:46:46,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:46:46,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:46:46,660 INFO L87 Difference]: Start difference. First operand 3035 states and 4623 transitions. Second operand 6 states. [2019-09-08 03:46:50,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:50,511 INFO L93 Difference]: Finished difference Result 9533 states and 14994 transitions. [2019-09-08 03:46:50,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:46:50,511 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 259 [2019-09-08 03:46:50,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:50,552 INFO L225 Difference]: With dead ends: 9533 [2019-09-08 03:46:50,552 INFO L226 Difference]: Without dead ends: 6617 [2019-09-08 03:46:50,565 INFO L628 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-09-08 03:46:50,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2019-09-08 03:46:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 6278. [2019-09-08 03:46:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6278 states. [2019-09-08 03:46:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6278 states to 6278 states and 9702 transitions. [2019-09-08 03:46:50,838 INFO L78 Accepts]: Start accepts. Automaton has 6278 states and 9702 transitions. Word has length 259 [2019-09-08 03:46:50,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:50,839 INFO L475 AbstractCegarLoop]: Abstraction has 6278 states and 9702 transitions. [2019-09-08 03:46:50,839 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:46:50,839 INFO L276 IsEmpty]: Start isEmpty. Operand 6278 states and 9702 transitions. [2019-09-08 03:46:50,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2019-09-08 03:46:50,842 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:50,842 INFO L399 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-09-08 03:46:50,842 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:50,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:50,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1542284448, now seen corresponding path program 1 times [2019-09-08 03:46:50,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:50,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:50,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:50,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:51,088 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 03:46:51,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:51,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:46:51,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:46:51,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:46:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:46:51,090 INFO L87 Difference]: Start difference. First operand 6278 states and 9702 transitions. Second operand 4 states. [2019-09-08 03:46:51,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:51,827 INFO L93 Difference]: Finished difference Result 12412 states and 19333 transitions. [2019-09-08 03:46:51,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:46:51,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 267 [2019-09-08 03:46:51,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:51,866 INFO L225 Difference]: With dead ends: 12412 [2019-09-08 03:46:51,866 INFO L226 Difference]: Without dead ends: 6241 [2019-09-08 03:46:51,886 INFO L628 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-09-08 03:46:51,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6241 states. [2019-09-08 03:46:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6241 to 6241. [2019-09-08 03:46:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2019-09-08 03:46:52,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 9628 transitions. [2019-09-08 03:46:52,211 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 9628 transitions. Word has length 267 [2019-09-08 03:46:52,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:52,211 INFO L475 AbstractCegarLoop]: Abstraction has 6241 states and 9628 transitions. [2019-09-08 03:46:52,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:46:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 9628 transitions. [2019-09-08 03:46:52,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-09-08 03:46:52,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:52,218 INFO L399 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-09-08 03:46:52,218 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:52,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:52,219 INFO L82 PathProgramCache]: Analyzing trace with hash -566475387, now seen corresponding path program 1 times [2019-09-08 03:46:52,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:52,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:52,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:52,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:52,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:52,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:52,514 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2019-09-08 03:46:52,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:46:52,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:46:52,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:46:52,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:46:52,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:46:52,516 INFO L87 Difference]: Start difference. First operand 6241 states and 9628 transitions. Second operand 10 states. [2019-09-08 03:46:52,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:52,816 INFO L93 Difference]: Finished difference Result 6317 states and 9722 transitions. [2019-09-08 03:46:52,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:46:52,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 268 [2019-09-08 03:46:52,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:52,859 INFO L225 Difference]: With dead ends: 6317 [2019-09-08 03:46:52,859 INFO L226 Difference]: Without dead ends: 6301 [2019-09-08 03:46:52,866 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:46:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6301 states. [2019-09-08 03:46:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6301 to 6276. [2019-09-08 03:46:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6276 states. [2019-09-08 03:46:53,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6276 states to 6276 states and 9658 transitions. [2019-09-08 03:46:53,215 INFO L78 Accepts]: Start accepts. Automaton has 6276 states and 9658 transitions. Word has length 268 [2019-09-08 03:46:53,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:46:53,216 INFO L475 AbstractCegarLoop]: Abstraction has 6276 states and 9658 transitions. [2019-09-08 03:46:53,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:46:53,216 INFO L276 IsEmpty]: Start isEmpty. Operand 6276 states and 9658 transitions. [2019-09-08 03:46:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-09-08 03:46:53,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:46:53,223 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:46:53,223 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:46:53,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:46:53,224 INFO L82 PathProgramCache]: Analyzing trace with hash -225823770, now seen corresponding path program 1 times [2019-09-08 03:46:53,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:46:53,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:46:53,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:53,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:53,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:46:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:54,098 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 249 trivial. 0 not checked. [2019-09-08 03:46:54,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:46:54,099 INFO L223 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-09-08 03:46:54,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:46:54,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:46:54,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 4278 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:46:54,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:46:54,866 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2019-09-08 03:46:54,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:46:54,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:46:54,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:46:54,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:46:54,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:46:54,875 INFO L87 Difference]: Start difference. First operand 6276 states and 9658 transitions. Second operand 15 states. [2019-09-08 03:47:09,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:09,435 INFO L93 Difference]: Finished difference Result 20896 states and 33176 transitions. [2019-09-08 03:47:09,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 03:47:09,436 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 393 [2019-09-08 03:47:09,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:09,525 INFO L225 Difference]: With dead ends: 20896 [2019-09-08 03:47:09,525 INFO L226 Difference]: Without dead ends: 14707 [2019-09-08 03:47:09,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 422 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 892 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=569, Invalid=2293, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 03:47:09,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14707 states. [2019-09-08 03:47:10,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14707 to 14479. [2019-09-08 03:47:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14479 states. [2019-09-08 03:47:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14479 states to 14479 states and 22258 transitions. [2019-09-08 03:47:10,333 INFO L78 Accepts]: Start accepts. Automaton has 14479 states and 22258 transitions. Word has length 393 [2019-09-08 03:47:10,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:10,334 INFO L475 AbstractCegarLoop]: Abstraction has 14479 states and 22258 transitions. [2019-09-08 03:47:10,334 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:47:10,334 INFO L276 IsEmpty]: Start isEmpty. Operand 14479 states and 22258 transitions. [2019-09-08 03:47:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2019-09-08 03:47:10,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:10,340 INFO L399 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-09-08 03:47:10,340 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:10,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:10,340 INFO L82 PathProgramCache]: Analyzing trace with hash 675466082, now seen corresponding path program 1 times [2019-09-08 03:47:10,340 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:10,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:10,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:10,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:10,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:10,574 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-09-08 03:47:10,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:10,575 INFO L223 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) [2019-09-08 03:47:10,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:11,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 4298 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:47:11,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 291 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (21)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:47:11,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:47:11,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-09-08 03:47:11,455 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:47:11,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:47:11,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:47:11,457 INFO L87 Difference]: Start difference. First operand 14479 states and 22258 transitions. Second operand 11 states. [2019-09-08 03:47:21,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:21,031 INFO L93 Difference]: Finished difference Result 30709 states and 48501 transitions. [2019-09-08 03:47:21,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:47:21,031 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 399 [2019-09-08 03:47:21,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:21,100 INFO L225 Difference]: With dead ends: 30709 [2019-09-08 03:47:21,100 INFO L226 Difference]: Without dead ends: 16345 [2019-09-08 03:47:21,150 INFO L628 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-09-08 03:47:21,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16345 states. [2019-09-08 03:47:21,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16345 to 15511. [2019-09-08 03:47:21,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15511 states. [2019-09-08 03:47:21,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15511 states to 15511 states and 24106 transitions. [2019-09-08 03:47:21,742 INFO L78 Accepts]: Start accepts. Automaton has 15511 states and 24106 transitions. Word has length 399 [2019-09-08 03:47:21,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:21,743 INFO L475 AbstractCegarLoop]: Abstraction has 15511 states and 24106 transitions. [2019-09-08 03:47:21,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:47:21,743 INFO L276 IsEmpty]: Start isEmpty. Operand 15511 states and 24106 transitions. [2019-09-08 03:47:21,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 03:47:21,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:21,747 INFO L399 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-09-08 03:47:21,747 INFO L418 AbstractCegarLoop]: === Iteration 39 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:21,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:21,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1951538389, now seen corresponding path program 1 times [2019-09-08 03:47:21,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:21,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:21,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:21,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:21,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2019-09-08 03:47:21,979 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:21,979 INFO L223 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) [2019-09-08 03:47:21,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:22,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 3573 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:47:22,674 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:22,831 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 108 proven. 10 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-09-08 03:47:22,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:47:22,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2019-09-08 03:47:22,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 03:47:22,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 03:47:22,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2019-09-08 03:47:22,840 INFO L87 Difference]: Start difference. First operand 15511 states and 24106 transitions. Second operand 19 states. [2019-09-08 03:47:32,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:32,963 INFO L93 Difference]: Finished difference Result 47921 states and 75261 transitions. [2019-09-08 03:47:32,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:47:32,964 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 302 [2019-09-08 03:47:32,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:33,136 INFO L225 Difference]: With dead ends: 47921 [2019-09-08 03:47:33,136 INFO L226 Difference]: Without dead ends: 32523 [2019-09-08 03:47:33,177 INFO L628 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-09-08 03:47:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32523 states. [2019-09-08 03:47:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32523 to 32467. [2019-09-08 03:47:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32467 states. [2019-09-08 03:47:35,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32467 states to 32467 states and 51123 transitions. [2019-09-08 03:47:35,786 INFO L78 Accepts]: Start accepts. Automaton has 32467 states and 51123 transitions. Word has length 302 [2019-09-08 03:47:35,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:35,787 INFO L475 AbstractCegarLoop]: Abstraction has 32467 states and 51123 transitions. [2019-09-08 03:47:35,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 03:47:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 32467 states and 51123 transitions. [2019-09-08 03:47:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2019-09-08 03:47:35,797 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:35,797 INFO L399 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-09-08 03:47:35,798 INFO L418 AbstractCegarLoop]: === Iteration 40 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1025541709, now seen corresponding path program 1 times [2019-09-08 03:47:35,798 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:35,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:35,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:35,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:35,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:36,009 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2019-09-08 03:47:36,009 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:36,009 INFO L223 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) [2019-09-08 03:47:36,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:36,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:36,629 INFO L256 TraceCheckSpWp]: Trace formula consists of 4304 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:47:36,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 301 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2019-09-08 03:47:36,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:47:36,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:47:36,730 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:47:36,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:47:36,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:47:36,731 INFO L87 Difference]: Start difference. First operand 32467 states and 51123 transitions. Second operand 9 states. [2019-09-08 03:47:38,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:38,610 INFO L93 Difference]: Finished difference Result 66703 states and 106493 transitions. [2019-09-08 03:47:38,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:47:38,610 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 404 [2019-09-08 03:47:38,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:38,799 INFO L225 Difference]: With dead ends: 66703 [2019-09-08 03:47:38,799 INFO L226 Difference]: Without dead ends: 34351 [2019-09-08 03:47:38,872 INFO L628 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-09-08 03:47:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34351 states. [2019-09-08 03:47:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34351 to 34339. [2019-09-08 03:47:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34339 states. [2019-09-08 03:47:40,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34339 states to 34339 states and 54579 transitions. [2019-09-08 03:47:40,012 INFO L78 Accepts]: Start accepts. Automaton has 34339 states and 54579 transitions. Word has length 404 [2019-09-08 03:47:40,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:40,012 INFO L475 AbstractCegarLoop]: Abstraction has 34339 states and 54579 transitions. [2019-09-08 03:47:40,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:47:40,013 INFO L276 IsEmpty]: Start isEmpty. Operand 34339 states and 54579 transitions. [2019-09-08 03:47:40,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-09-08 03:47:40,021 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:40,021 INFO L399 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-09-08 03:47:40,021 INFO L418 AbstractCegarLoop]: === Iteration 41 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:40,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:40,022 INFO L82 PathProgramCache]: Analyzing trace with hash -642179231, now seen corresponding path program 1 times [2019-09-08 03:47:40,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:40,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:40,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:40,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:40,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:40,623 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2019-09-08 03:47:40,624 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:40,624 INFO L223 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-09-08 03:47:40,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:41,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 4308 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-08 03:47:41,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2019-09-08 03:47:41,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:47:41,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-09-08 03:47:41,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:47:41,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:47:41,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:47:41,406 INFO L87 Difference]: Start difference. First operand 34339 states and 54579 transitions. Second operand 15 states. [2019-09-08 03:47:58,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:47:58,802 INFO L93 Difference]: Finished difference Result 134723 states and 222685 transitions. [2019-09-08 03:47:58,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:47:58,809 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 409 [2019-09-08 03:47:58,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:47:59,503 INFO L225 Difference]: With dead ends: 134723 [2019-09-08 03:47:59,503 INFO L226 Difference]: Without dead ends: 100215 [2019-09-08 03:47:59,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 431 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1573, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 03:47:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100215 states. [2019-09-08 03:48:05,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100215 to 99769. [2019-09-08 03:48:05,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99769 states. [2019-09-08 03:48:06,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99769 states to 99769 states and 163421 transitions. [2019-09-08 03:48:06,521 INFO L78 Accepts]: Start accepts. Automaton has 99769 states and 163421 transitions. Word has length 409 [2019-09-08 03:48:06,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:48:06,522 INFO L475 AbstractCegarLoop]: Abstraction has 99769 states and 163421 transitions. [2019-09-08 03:48:06,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:48:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 99769 states and 163421 transitions. [2019-09-08 03:48:06,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-09-08 03:48:06,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:48:06,526 INFO L399 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:48:06,527 INFO L418 AbstractCegarLoop]: === Iteration 42 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:48:06,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:48:06,527 INFO L82 PathProgramCache]: Analyzing trace with hash 565655457, now seen corresponding path program 1 times [2019-09-08 03:48:06,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:48:06,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:48:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:06,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:06,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:06,783 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 49 proven. 16 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:48:06,783 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:48:06,783 INFO L223 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) [2019-09-08 03:48:06,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:48:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:07,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 4037 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:48:07,347 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:48:07,420 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 285 trivial. 0 not checked. [2019-09-08 03:48:07,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:48:07,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 03:48:07,428 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:48:07,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:48:07,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:48:07,428 INFO L87 Difference]: Start difference. First operand 99769 states and 163421 transitions. Second operand 12 states. [2019-09-08 03:48:31,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:48:31,069 INFO L93 Difference]: Finished difference Result 317718 states and 537902 transitions. [2019-09-08 03:48:31,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:48:31,070 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 388 [2019-09-08 03:48:31,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:48:32,186 INFO L225 Difference]: With dead ends: 317718 [2019-09-08 03:48:32,186 INFO L226 Difference]: Without dead ends: 216710 [2019-09-08 03:48:32,493 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:48:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216710 states. [2019-09-08 03:48:44,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216710 to 215435. [2019-09-08 03:48:44,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215435 states. [2019-09-08 03:48:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215435 states to 215435 states and 357209 transitions. [2019-09-08 03:48:45,645 INFO L78 Accepts]: Start accepts. Automaton has 215435 states and 357209 transitions. Word has length 388 [2019-09-08 03:48:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:48:45,646 INFO L475 AbstractCegarLoop]: Abstraction has 215435 states and 357209 transitions. [2019-09-08 03:48:45,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:48:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 215435 states and 357209 transitions. [2019-09-08 03:48:45,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 03:48:45,656 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:48:45,656 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 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-09-08 03:48:45,656 INFO L418 AbstractCegarLoop]: === Iteration 43 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:48:45,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:48:45,657 INFO L82 PathProgramCache]: Analyzing trace with hash -5811428, now seen corresponding path program 1 times [2019-09-08 03:48:45,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:48:45,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:48:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:45,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:48:45,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:48:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:45,864 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 348 trivial. 0 not checked. [2019-09-08 03:48:45,865 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:48:45,865 INFO L223 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) [2019-09-08 03:48:45,887 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:48:46,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:48:46,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 4035 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:48:46,443 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:48:51,436 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 51 proven. 139 refuted. 0 times theorem prover too weak. 173 trivial. 0 not checked. [2019-09-08 03:48:51,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:48:51,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-09-08 03:48:51,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:48:51,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:48:51,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:48:51,448 INFO L87 Difference]: Start difference. First operand 215435 states and 357209 transitions. Second operand 11 states. [2019-09-08 03:49:14,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:49:14,982 INFO L93 Difference]: Finished difference Result 494227 states and 842166 transitions. [2019-09-08 03:49:14,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:49:14,983 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 390 [2019-09-08 03:49:14,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:49:16,593 INFO L225 Difference]: With dead ends: 494227 [2019-09-08 03:49:16,593 INFO L226 Difference]: Without dead ends: 277885 [2019-09-08 03:49:17,025 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:49:17,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277885 states. [2019-09-08 03:49:34,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277885 to 269468. [2019-09-08 03:49:34,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269468 states. [2019-09-08 03:49:37,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269468 states to 269468 states and 441444 transitions. [2019-09-08 03:49:38,018 INFO L78 Accepts]: Start accepts. Automaton has 269468 states and 441444 transitions. Word has length 390 [2019-09-08 03:49:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:49:38,019 INFO L475 AbstractCegarLoop]: Abstraction has 269468 states and 441444 transitions. [2019-09-08 03:49:38,019 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:49:38,019 INFO L276 IsEmpty]: Start isEmpty. Operand 269468 states and 441444 transitions. [2019-09-08 03:49:38,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2019-09-08 03:49:38,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:49:38,042 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 7, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:49:38,042 INFO L418 AbstractCegarLoop]: === Iteration 44 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:49:38,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:49:38,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1679401314, now seen corresponding path program 1 times [2019-09-08 03:49:38,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:49:38,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:49:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:38,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:38,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:49:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:38,241 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 351 trivial. 0 not checked. [2019-09-08 03:49:38,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:49:38,241 INFO L223 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-09-08 03:49:38,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:49:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:49:38,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 4032 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:49:38,811 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:49:38,959 INFO L134 CoverageAnalysis]: Checked inductivity of 363 backedges. 61 proven. 54 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2019-09-08 03:49:38,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:49:38,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 12 [2019-09-08 03:49:38,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:49:38,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:49:38,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:49:38,968 INFO L87 Difference]: Start difference. First operand 269468 states and 441444 transitions. Second operand 12 states. [2019-09-08 03:50:15,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:15,195 INFO L93 Difference]: Finished difference Result 654526 states and 1080458 transitions. [2019-09-08 03:50:15,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-09-08 03:50:15,196 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 390 [2019-09-08 03:50:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:17,233 INFO L225 Difference]: With dead ends: 654526 [2019-09-08 03:50:17,233 INFO L226 Difference]: Without dead ends: 377398 [2019-09-08 03:50:17,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 461 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=398, Invalid=1954, Unknown=0, NotChecked=0, Total=2352 [2019-09-08 03:50:18,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377398 states. [2019-09-08 03:50:50,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377398 to 368101. [2019-09-08 03:50:50,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368101 states. [2019-09-08 03:50:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368101 states to 368101 states and 597464 transitions. [2019-09-08 03:50:52,595 INFO L78 Accepts]: Start accepts. Automaton has 368101 states and 597464 transitions. Word has length 390 [2019-09-08 03:50:52,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:52,595 INFO L475 AbstractCegarLoop]: Abstraction has 368101 states and 597464 transitions. [2019-09-08 03:50:52,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:50:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 368101 states and 597464 transitions. [2019-09-08 03:50:52,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2019-09-08 03:50:52,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:52,607 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 5, 4, 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, 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-09-08 03:50:52,607 INFO L418 AbstractCegarLoop]: === Iteration 45 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:52,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:52,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1184251186, now seen corresponding path program 1 times [2019-09-08 03:50:52,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:52,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:52,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:52,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:52,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:53,825 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 52 proven. 17 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2019-09-08 03:50:53,825 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:53,825 INFO L223 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-09-08 03:50:53,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:54,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 4037 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:50:54,375 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (28)] Exception during sending of exit command (exit): Stream Closed [2019-09-08 03:50:54,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:54,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-09-08 03:50:54,469 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:50:54,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:50:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:50:54,470 INFO L87 Difference]: Start difference. First operand 368101 states and 597464 transitions. Second operand 12 states. [2019-09-08 03:51:46,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:46,160 INFO L93 Difference]: Finished difference Result 802338 states and 1330011 transitions. [2019-09-08 03:51:46,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 03:51:46,160 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 391 [2019-09-08 03:51:46,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:48,430 INFO L225 Difference]: With dead ends: 802338 [2019-09-08 03:51:48,430 INFO L226 Difference]: Without dead ends: 432283 [2019-09-08 03:51:49,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 402 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=211, Invalid=1195, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 03:51:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432283 states. [2019-09-08 03:52:22,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432283 to 428957. [2019-09-08 03:52:22,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428957 states. [2019-09-08 03:52:26,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428957 states to 428957 states and 693695 transitions. [2019-09-08 03:52:26,651 INFO L78 Accepts]: Start accepts. Automaton has 428957 states and 693695 transitions. Word has length 391 [2019-09-08 03:52:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:26,651 INFO L475 AbstractCegarLoop]: Abstraction has 428957 states and 693695 transitions. [2019-09-08 03:52:26,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:52:26,651 INFO L276 IsEmpty]: Start isEmpty. Operand 428957 states and 693695 transitions. [2019-09-08 03:52:26,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2019-09-08 03:52:26,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:26,673 INFO L399 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, 1] [2019-09-08 03:52:26,674 INFO L418 AbstractCegarLoop]: === Iteration 46 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:26,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:26,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1596482145, now seen corresponding path program 1 times [2019-09-08 03:52:26,674 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:26,674 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:26,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:26,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:26,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:27,059 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 304 trivial. 0 not checked. [2019-09-08 03:52:27,059 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:52:27,059 INFO L223 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-09-08 03:52:27,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:27,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:27,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 4043 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:52:27,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:52:27,737 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (29)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:52:27,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:52:27,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 13 [2019-09-08 03:52:27,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:52:27,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:52:27,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:52:27,756 INFO L87 Difference]: Start difference. First operand 428957 states and 693695 transitions. Second operand 13 states. [2019-09-08 03:53:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:39,920 INFO L93 Difference]: Finished difference Result 1108933 states and 1884182 transitions. [2019-09-08 03:53:39,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:53:39,921 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 395 [2019-09-08 03:53:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:44,298 INFO L225 Difference]: With dead ends: 1108933 [2019-09-08 03:53:44,298 INFO L226 Difference]: Without dead ends: 665728 [2019-09-08 03:53:46,050 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 409 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-09-08 03:53:46,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665728 states. [2019-09-08 03:54:37,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665728 to 653121. [2019-09-08 03:54:37,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653121 states. [2019-09-08 03:54:58,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653121 states to 653121 states and 1074628 transitions. [2019-09-08 03:54:58,316 INFO L78 Accepts]: Start accepts. Automaton has 653121 states and 1074628 transitions. Word has length 395 [2019-09-08 03:54:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:58,317 INFO L475 AbstractCegarLoop]: Abstraction has 653121 states and 1074628 transitions. [2019-09-08 03:54:58,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:54:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 653121 states and 1074628 transitions. [2019-09-08 03:54:58,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-09-08 03:54:58,335 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:58,335 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 03:54:58,335 INFO L418 AbstractCegarLoop]: === Iteration 47 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:58,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:58,336 INFO L82 PathProgramCache]: Analyzing trace with hash 311241679, now seen corresponding path program 1 times [2019-09-08 03:54:58,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:58,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:58,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:58,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:58,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:58,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:58,691 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-09-08 03:54:58,692 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:54:58,692 INFO L223 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-09-08 03:54:58,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:59,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:59,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 4156 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-08 03:54:59,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:54:59,467 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2019-09-08 03:54:59,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 03:54:59,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-09-08 03:54:59,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:54:59,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:54:59,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:54:59,490 INFO L87 Difference]: Start difference. First operand 653121 states and 1074628 transitions. Second operand 12 states.