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_spec13_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:44:21,224 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:44:21,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:44:21,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:44:21,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:44:21,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:44:21,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:44:21,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:44:21,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:44:21,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:44:21,247 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:44:21,250 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:44:21,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:44:21,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:44:21,257 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:44:21,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:44:21,263 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:44:21,264 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:44:21,266 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:44:21,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:44:21,270 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:44:21,271 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:44:21,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:44:21,273 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:44:21,276 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:44:21,276 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:44:21,276 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:44:21,277 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:44:21,278 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:44:21,279 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:44:21,279 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:44:21,280 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:44:21,281 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:44:21,281 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:44:21,282 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:44:21,283 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:44:21,283 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:44:21,284 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:44:21,284 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:44:21,285 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:44:21,285 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:44:21,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:44:21,302 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:44:21,302 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:44:21,303 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:44:21,304 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:44:21,304 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:44:21,304 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:44:21,304 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:44:21,305 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:44:21,305 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:44:21,305 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:44:21,305 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:44:21,305 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:44:21,306 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:44:21,306 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:44:21,306 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:44:21,306 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:44:21,306 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:44:21,307 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:44:21,307 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:44:21,307 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:44:21,307 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:44:21,307 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:44:21,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:44:21,308 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:44:21,308 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:44:21,308 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:44:21,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:44:21,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:44:21,309 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:44:21,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:44:21,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:44:21,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:44:21,358 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:44:21,359 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:44:21,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec13_product23.cil.c [2019-10-02 11:44:21,424 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10403111/744e3fb9e00446a3b6e1c86aee674a14/FLAG1044326a7 [2019-10-02 11:44:22,086 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:44:22,087 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec13_product23.cil.c [2019-10-02 11:44:22,122 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10403111/744e3fb9e00446a3b6e1c86aee674a14/FLAG1044326a7 [2019-10-02 11:44:22,279 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10403111/744e3fb9e00446a3b6e1c86aee674a14 [2019-10-02 11:44:22,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:44:22,294 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:44:22,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:44:22,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:44:22,299 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:44:22,300 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:44:22" (1/1) ... [2019-10-02 11:44:22,304 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5d2151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:22, skipping insertion in model container [2019-10-02 11:44:22,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:44:22" (1/1) ... [2019-10-02 11:44:22,313 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:44:22,408 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:44:23,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:44:23,157 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:44:23,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:44:23,354 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:44:23,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23 WrapperNode [2019-10-02 11:44:23,354 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:44:23,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:44:23,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:44:23,356 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:44:23,370 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (1/1) ... [2019-10-02 11:44:23,370 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (1/1) ... [2019-10-02 11:44:23,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (1/1) ... [2019-10-02 11:44:23,405 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (1/1) ... [2019-10-02 11:44:23,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (1/1) ... [2019-10-02 11:44:23,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (1/1) ... [2019-10-02 11:44:23,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (1/1) ... [2019-10-02 11:44:23,528 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:44:23,529 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:44:23,529 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:44:23,529 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:44:23,530 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:44:23,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:44:23,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:44:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:44:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:44:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:44:23,613 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:44:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:44:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:44:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:44:23,614 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:44:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:44:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:44:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:44:23,615 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:44:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:44:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:44:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:44:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:44:23,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:44:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:44:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:44:23,617 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:44:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:44:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:44:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:44:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:44:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:44:23,618 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:44:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:44:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:44:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:44:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:44:23,619 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:44:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:44:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:44:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:44:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:44:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:44:23,620 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:44:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:44:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:44:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:44:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:44:23,621 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:44:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:44:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:44:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:44:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:44:23,622 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:44:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:44:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:44:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:44:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:44:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:44:23,623 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:44:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:44:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:44:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:44:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:44:23,624 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:44:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:44:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:44:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:44:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:44:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:44:23,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:44:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:44:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:44:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:44:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:44:23,626 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:44:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:44:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:44:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:44:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:44:23,627 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:44:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:44:23,628 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:44:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:44:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:44:23,628 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:44:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:44:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:44:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:44:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:44:23,629 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:44:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:44:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:44:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__1 [2019-10-02 11:44:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:44:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__2 [2019-10-02 11:44:23,630 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:44:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:44:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:44:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:44:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:44:23,631 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:44:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:44:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:44:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:44:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:44:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:44:23,632 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:44:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:44:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:44:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:44:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:44:23,633 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:44:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:44:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:44:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:44:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:44:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:44:23,634 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:44:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:44:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:44:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:44:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:44:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:44:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:44:23,635 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:44:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:44:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:44:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:44:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:44:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-02 11:44:23,636 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:44:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:44:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:44:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-02 11:44:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:44:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:44:23,637 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:44:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:44:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:44:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:44:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:44:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:44:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:44:23,638 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:44:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:44:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:44:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:44:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:44:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:44:23,639 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:44:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:44:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:44:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:44:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:44:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:44:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:44:23,640 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:44:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:44:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:44:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:44:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:44:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:44:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:44:23,641 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:44:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:44:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:44:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:44:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:44:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:44:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:44:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:44:23,642 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:44:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:44:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:44:23,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:44:26,082 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:44:26,082 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:44:26,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:26 BoogieIcfgContainer [2019-10-02 11:44:26,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:44:26,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:44:26,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:44:26,089 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:44:26,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:44:22" (1/3) ... [2019-10-02 11:44:26,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ecc148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:26, skipping insertion in model container [2019-10-02 11:44:26,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:44:23" (2/3) ... [2019-10-02 11:44:26,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22ecc148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:44:26, skipping insertion in model container [2019-10-02 11:44:26,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:44:26" (3/3) ... [2019-10-02 11:44:26,093 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec13_product23.cil.c [2019-10-02 11:44:26,104 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:44:26,114 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:44:26,133 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:44:26,179 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:44:26,180 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:44:26,180 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:44:26,180 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:44:26,180 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:44:26,180 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:44:26,181 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:44:26,181 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:44:26,181 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:44:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 816 states. [2019-10-02 11:44:26,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 11:44:26,267 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:26,269 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:26,273 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:26,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1416283797, now seen corresponding path program 1 times [2019-10-02 11:44:26,282 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:26,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:26,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:26,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:26,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:44:27,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:27,047 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:27,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:27,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:27,749 INFO L256 TraceCheckSpWp]: Trace formula consists of 3003 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 11:44:27,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:27,852 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:44:27,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:27,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-10-02 11:44:27,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:44:27,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:44:27,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:27,893 INFO L87 Difference]: Start difference. First operand 816 states. Second operand 7 states. [2019-10-02 11:44:28,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:28,260 INFO L93 Difference]: Finished difference Result 1342 states and 2164 transitions. [2019-10-02 11:44:28,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:44:28,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 161 [2019-10-02 11:44:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:28,306 INFO L225 Difference]: With dead ends: 1342 [2019-10-02 11:44:28,306 INFO L226 Difference]: Without dead ends: 674 [2019-10-02 11:44:28,321 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2019-10-02 11:44:28,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 674. [2019-10-02 11:44:28,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2019-10-02 11:44:28,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 1063 transitions. [2019-10-02 11:44:28,453 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 1063 transitions. Word has length 161 [2019-10-02 11:44:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:28,454 INFO L475 AbstractCegarLoop]: Abstraction has 674 states and 1063 transitions. [2019-10-02 11:44:28,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:44:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 1063 transitions. [2019-10-02 11:44:28,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 11:44:28,463 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:28,463 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:28,464 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:28,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:28,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1394548635, now seen corresponding path program 1 times [2019-10-02 11:44:28,465 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:28,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:28,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:28,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:28,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:28,721 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:44:28,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:28,721 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:28,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:29,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 2999 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:44:29,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:29,429 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:44:29,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:29,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:44:29,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:44:29,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:44:29,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:44:29,451 INFO L87 Difference]: Start difference. First operand 674 states and 1063 transitions. Second operand 12 states. [2019-10-02 11:44:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:29,682 INFO L93 Difference]: Finished difference Result 1329 states and 2111 transitions. [2019-10-02 11:44:29,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:44:29,683 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 163 [2019-10-02 11:44:29,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:29,692 INFO L225 Difference]: With dead ends: 1329 [2019-10-02 11:44:29,692 INFO L226 Difference]: Without dead ends: 683 [2019-10-02 11:44:29,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:44:29,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-10-02 11:44:29,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2019-10-02 11:44:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-10-02 11:44:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1075 transitions. [2019-10-02 11:44:29,752 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1075 transitions. Word has length 163 [2019-10-02 11:44:29,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:29,755 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 1075 transitions. [2019-10-02 11:44:29,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:44:29,755 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1075 transitions. [2019-10-02 11:44:29,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 11:44:29,767 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:29,767 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:29,768 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:29,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:29,768 INFO L82 PathProgramCache]: Analyzing trace with hash -146815623, now seen corresponding path program 1 times [2019-10-02 11:44:29,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:29,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:29,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:29,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 11:44:30,040 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:30,040 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:30,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:30,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:30,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 3000 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:44:30,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:30,589 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 11:44:30,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:30,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 11:44:30,598 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:44:30,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:44:30,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:30,600 INFO L87 Difference]: Start difference. First operand 681 states and 1075 transitions. Second operand 6 states. [2019-10-02 11:44:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:30,773 INFO L93 Difference]: Finished difference Result 1341 states and 2131 transitions. [2019-10-02 11:44:30,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:44:30,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 164 [2019-10-02 11:44:30,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:30,782 INFO L225 Difference]: With dead ends: 1341 [2019-10-02 11:44:30,783 INFO L226 Difference]: Without dead ends: 682 [2019-10-02 11:44:30,787 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:30,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-10-02 11:44:30,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 682. [2019-10-02 11:44:30,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 11:44:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1071 transitions. [2019-10-02 11:44:30,831 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1071 transitions. Word has length 164 [2019-10-02 11:44:30,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:30,832 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1071 transitions. [2019-10-02 11:44:30,832 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:44:30,832 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1071 transitions. [2019-10-02 11:44:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 11:44:30,838 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:30,839 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:30,839 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:30,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:30,839 INFO L82 PathProgramCache]: Analyzing trace with hash -10166637, now seen corresponding path program 1 times [2019-10-02 11:44:30,839 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:30,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:30,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:30,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:44:31,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:31,136 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:31,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:31,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 3001 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:44:31,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:44:31,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:31,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:44:31,776 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:44:31,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:44:31,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:44:31,778 INFO L87 Difference]: Start difference. First operand 682 states and 1071 transitions. Second operand 12 states. [2019-10-02 11:44:31,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:31,973 INFO L93 Difference]: Finished difference Result 1334 states and 2113 transitions. [2019-10-02 11:44:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:44:31,973 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 165 [2019-10-02 11:44:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:31,979 INFO L225 Difference]: With dead ends: 1334 [2019-10-02 11:44:31,980 INFO L226 Difference]: Without dead ends: 685 [2019-10-02 11:44:31,983 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:44:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-02 11:44:32,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2019-10-02 11:44:32,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 11:44:32,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1071 transitions. [2019-10-02 11:44:32,012 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1071 transitions. Word has length 165 [2019-10-02 11:44:32,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:32,012 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1071 transitions. [2019-10-02 11:44:32,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:44:32,013 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1071 transitions. [2019-10-02 11:44:32,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 11:44:32,018 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:32,018 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:32,018 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:32,019 INFO L82 PathProgramCache]: Analyzing trace with hash 886400429, now seen corresponding path program 1 times [2019-10-02 11:44:32,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:32,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:32,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:32,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:32,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:44:32,213 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:32,213 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:32,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:32,726 INFO L256 TraceCheckSpWp]: Trace formula consists of 3002 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 11:44:32,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:32,817 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:44:32,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:32,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:44:32,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:44:32,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:44:32,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:44:32,826 INFO L87 Difference]: Start difference. First operand 682 states and 1071 transitions. Second operand 12 states. [2019-10-02 11:44:33,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:33,042 INFO L93 Difference]: Finished difference Result 1334 states and 2113 transitions. [2019-10-02 11:44:33,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:44:33,042 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 166 [2019-10-02 11:44:33,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:33,051 INFO L225 Difference]: With dead ends: 1334 [2019-10-02 11:44:33,052 INFO L226 Difference]: Without dead ends: 685 [2019-10-02 11:44:33,057 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:44:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2019-10-02 11:44:33,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 682. [2019-10-02 11:44:33,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 682 states. [2019-10-02 11:44:33,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 1071 transitions. [2019-10-02 11:44:33,086 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 1071 transitions. Word has length 166 [2019-10-02 11:44:33,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:33,086 INFO L475 AbstractCegarLoop]: Abstraction has 682 states and 1071 transitions. [2019-10-02 11:44:33,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:44:33,087 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 1071 transitions. [2019-10-02 11:44:33,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 11:44:33,093 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:33,094 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:33,094 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1269857801, now seen corresponding path program 1 times [2019-10-02 11:44:33,094 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:33,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:33,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:33,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:33,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:33,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:33,303 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 11:44:33,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:33,303 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:33,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:33,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 3003 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:44:33,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:34,036 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:44:34,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:34,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:44:34,056 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:44:34,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:44:34,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:34,057 INFO L87 Difference]: Start difference. First operand 682 states and 1071 transitions. Second operand 9 states. [2019-10-02 11:44:34,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:34,426 INFO L93 Difference]: Finished difference Result 1348 states and 2141 transitions. [2019-10-02 11:44:34,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:44:34,427 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-02 11:44:34,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:34,432 INFO L225 Difference]: With dead ends: 1348 [2019-10-02 11:44:34,433 INFO L226 Difference]: Without dead ends: 699 [2019-10-02 11:44:34,437 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:44:34,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-10-02 11:44:34,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 696. [2019-10-02 11:44:34,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-10-02 11:44:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1089 transitions. [2019-10-02 11:44:34,464 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1089 transitions. Word has length 167 [2019-10-02 11:44:34,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:34,464 INFO L475 AbstractCegarLoop]: Abstraction has 696 states and 1089 transitions. [2019-10-02 11:44:34,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:44:34,464 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1089 transitions. [2019-10-02 11:44:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-10-02 11:44:34,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:34,470 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:34,470 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:34,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:34,471 INFO L82 PathProgramCache]: Analyzing trace with hash -442693717, now seen corresponding path program 1 times [2019-10-02 11:44:34,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:34,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:34,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:34,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:34,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:34,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:34,614 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:44:34,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:34,614 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:34,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:35,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 3000 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 11:44:35,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-10-02 11:44:35,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:35,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 11:44:35,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:44:35,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:44:35,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:44:35,571 INFO L87 Difference]: Start difference. First operand 696 states and 1089 transitions. Second operand 14 states. [2019-10-02 11:44:35,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:35,869 INFO L93 Difference]: Finished difference Result 1381 states and 2180 transitions. [2019-10-02 11:44:35,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:44:35,869 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 168 [2019-10-02 11:44:35,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:35,878 INFO L225 Difference]: With dead ends: 1381 [2019-10-02 11:44:35,878 INFO L226 Difference]: Without dead ends: 718 [2019-10-02 11:44:35,884 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:44:35,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2019-10-02 11:44:35,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 706. [2019-10-02 11:44:35,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 706 states. [2019-10-02 11:44:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 706 states to 706 states and 1108 transitions. [2019-10-02 11:44:35,913 INFO L78 Accepts]: Start accepts. Automaton has 706 states and 1108 transitions. Word has length 168 [2019-10-02 11:44:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:35,914 INFO L475 AbstractCegarLoop]: Abstraction has 706 states and 1108 transitions. [2019-10-02 11:44:35,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:44:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 706 states and 1108 transitions. [2019-10-02 11:44:35,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-02 11:44:35,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:35,920 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:35,920 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:35,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:35,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1940556227, now seen corresponding path program 1 times [2019-10-02 11:44:35,920 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:35,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:35,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:35,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:35,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:36,082 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:44:36,083 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:36,083 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:36,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:36,764 INFO L256 TraceCheckSpWp]: Trace formula consists of 3006 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:44:36,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:36,840 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:44:36,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:36,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:44:36,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:44:36,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:44:36,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:36,860 INFO L87 Difference]: Start difference. First operand 706 states and 1108 transitions. Second operand 8 states. [2019-10-02 11:44:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:37,002 INFO L93 Difference]: Finished difference Result 1397 states and 2221 transitions. [2019-10-02 11:44:37,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:44:37,003 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2019-10-02 11:44:37,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:37,011 INFO L225 Difference]: With dead ends: 1397 [2019-10-02 11:44:37,012 INFO L226 Difference]: Without dead ends: 722 [2019-10-02 11:44:37,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:44:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2019-10-02 11:44:37,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 714. [2019-10-02 11:44:37,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 714 states. [2019-10-02 11:44:37,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1122 transitions. [2019-10-02 11:44:37,061 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1122 transitions. Word has length 170 [2019-10-02 11:44:37,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:37,062 INFO L475 AbstractCegarLoop]: Abstraction has 714 states and 1122 transitions. [2019-10-02 11:44:37,062 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:44:37,062 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1122 transitions. [2019-10-02 11:44:37,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-02 11:44:37,071 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:37,072 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:37,072 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:37,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash 110421016, now seen corresponding path program 1 times [2019-10-02 11:44:37,073 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:37,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:37,271 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:44:37,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:37,273 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:37,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:37,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 3007 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:44:37,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:37,923 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 11:44:37,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:37,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-10-02 11:44:37,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:44:37,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:44:37,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:37,933 INFO L87 Difference]: Start difference. First operand 714 states and 1122 transitions. Second operand 8 states. [2019-10-02 11:44:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:38,062 INFO L93 Difference]: Finished difference Result 1409 states and 2242 transitions. [2019-10-02 11:44:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:44:38,062 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 171 [2019-10-02 11:44:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:38,070 INFO L225 Difference]: With dead ends: 1409 [2019-10-02 11:44:38,070 INFO L226 Difference]: Without dead ends: 726 [2019-10-02 11:44:38,075 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:44:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2019-10-02 11:44:38,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 718. [2019-10-02 11:44:38,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 718 states. [2019-10-02 11:44:38,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 718 states to 718 states and 1130 transitions. [2019-10-02 11:44:38,109 INFO L78 Accepts]: Start accepts. Automaton has 718 states and 1130 transitions. Word has length 171 [2019-10-02 11:44:38,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:38,109 INFO L475 AbstractCegarLoop]: Abstraction has 718 states and 1130 transitions. [2019-10-02 11:44:38,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:44:38,109 INFO L276 IsEmpty]: Start isEmpty. Operand 718 states and 1130 transitions. [2019-10-02 11:44:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-10-02 11:44:38,120 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:38,120 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:38,120 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:38,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:38,121 INFO L82 PathProgramCache]: Analyzing trace with hash 327425762, now seen corresponding path program 1 times [2019-10-02 11:44:38,121 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:38,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:38,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:38,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:38,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:38,284 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:38,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:38,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:44:38,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:44:38,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:44:38,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:38,289 INFO L87 Difference]: Start difference. First operand 718 states and 1130 transitions. Second operand 9 states. [2019-10-02 11:44:38,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:38,504 INFO L93 Difference]: Finished difference Result 1351 states and 2125 transitions. [2019-10-02 11:44:38,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:44:38,504 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-10-02 11:44:38,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:38,510 INFO L225 Difference]: With dead ends: 1351 [2019-10-02 11:44:38,510 INFO L226 Difference]: Without dead ends: 728 [2019-10-02 11:44:38,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:44:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-02 11:44:38,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 724. [2019-10-02 11:44:38,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-02 11:44:38,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1137 transitions. [2019-10-02 11:44:38,543 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1137 transitions. Word has length 172 [2019-10-02 11:44:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:38,543 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 1137 transitions. [2019-10-02 11:44:38,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:44:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1137 transitions. [2019-10-02 11:44:38,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 11:44:38,549 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:38,549 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:38,550 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:38,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:38,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1626653470, now seen corresponding path program 1 times [2019-10-02 11:44:38,550 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:38,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:38,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:38,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:38,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:38,726 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:38,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:38,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:44:38,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:44:38,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:44:38,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:44:38,727 INFO L87 Difference]: Start difference. First operand 724 states and 1137 transitions. Second operand 9 states. [2019-10-02 11:44:39,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:39,016 INFO L93 Difference]: Finished difference Result 1353 states and 2126 transitions. [2019-10-02 11:44:39,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:44:39,017 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 173 [2019-10-02 11:44:39,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:39,023 INFO L225 Difference]: With dead ends: 1353 [2019-10-02 11:44:39,023 INFO L226 Difference]: Without dead ends: 730 [2019-10-02 11:44:39,027 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:44:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2019-10-02 11:44:39,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 724. [2019-10-02 11:44:39,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 724 states. [2019-10-02 11:44:39,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 724 states to 724 states and 1137 transitions. [2019-10-02 11:44:39,055 INFO L78 Accepts]: Start accepts. Automaton has 724 states and 1137 transitions. Word has length 173 [2019-10-02 11:44:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:39,056 INFO L475 AbstractCegarLoop]: Abstraction has 724 states and 1137 transitions. [2019-10-02 11:44:39,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:44:39,056 INFO L276 IsEmpty]: Start isEmpty. Operand 724 states and 1137 transitions. [2019-10-02 11:44:39,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-10-02 11:44:39,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:39,062 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:39,062 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:39,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:39,063 INFO L82 PathProgramCache]: Analyzing trace with hash 112515314, now seen corresponding path program 1 times [2019-10-02 11:44:39,063 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:39,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:39,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:39,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:39,175 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 11:44:39,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:39,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:44:39,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:44:39,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:44:39,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:44:39,177 INFO L87 Difference]: Start difference. First operand 724 states and 1137 transitions. Second operand 4 states. [2019-10-02 11:44:39,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:39,236 INFO L93 Difference]: Finished difference Result 1395 states and 2211 transitions. [2019-10-02 11:44:39,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:44:39,237 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 173 [2019-10-02 11:44:39,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:39,242 INFO L225 Difference]: With dead ends: 1395 [2019-10-02 11:44:39,243 INFO L226 Difference]: Without dead ends: 701 [2019-10-02 11:44:39,247 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:44:39,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2019-10-02 11:44:39,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 701. [2019-10-02 11:44:39,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-10-02 11:44:39,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 1089 transitions. [2019-10-02 11:44:39,272 INFO L78 Accepts]: Start accepts. Automaton has 701 states and 1089 transitions. Word has length 173 [2019-10-02 11:44:39,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:39,273 INFO L475 AbstractCegarLoop]: Abstraction has 701 states and 1089 transitions. [2019-10-02 11:44:39,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:44:39,273 INFO L276 IsEmpty]: Start isEmpty. Operand 701 states and 1089 transitions. [2019-10-02 11:44:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 11:44:39,278 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:39,279 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:39,279 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:39,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:39,279 INFO L82 PathProgramCache]: Analyzing trace with hash 618872510, now seen corresponding path program 1 times [2019-10-02 11:44:39,279 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:39,280 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:39,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:39,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:39,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:39,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:44:39,402 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:39,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:44:39,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:44:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:44:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:44:39,403 INFO L87 Difference]: Start difference. First operand 701 states and 1089 transitions. Second operand 6 states. [2019-10-02 11:44:39,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:39,625 INFO L93 Difference]: Finished difference Result 1389 states and 2182 transitions. [2019-10-02 11:44:39,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:44:39,625 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 174 [2019-10-02 11:44:39,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:39,631 INFO L225 Difference]: With dead ends: 1389 [2019-10-02 11:44:39,631 INFO L226 Difference]: Without dead ends: 711 [2019-10-02 11:44:39,635 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2019-10-02 11:44:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 708. [2019-10-02 11:44:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 708 states. [2019-10-02 11:44:39,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 708 states to 708 states and 1093 transitions. [2019-10-02 11:44:39,661 INFO L78 Accepts]: Start accepts. Automaton has 708 states and 1093 transitions. Word has length 174 [2019-10-02 11:44:39,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:39,661 INFO L475 AbstractCegarLoop]: Abstraction has 708 states and 1093 transitions. [2019-10-02 11:44:39,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:44:39,661 INFO L276 IsEmpty]: Start isEmpty. Operand 708 states and 1093 transitions. [2019-10-02 11:44:39,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 11:44:39,666 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:39,667 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:39,667 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:39,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash 289453308, now seen corresponding path program 1 times [2019-10-02 11:44:39,667 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:39,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:39,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:39,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:39,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 11:44:39,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:39,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:44:39,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:44:39,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:44:39,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:44:39,872 INFO L87 Difference]: Start difference. First operand 708 states and 1093 transitions. Second operand 7 states. [2019-10-02 11:44:40,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:40,024 INFO L93 Difference]: Finished difference Result 1335 states and 2079 transitions. [2019-10-02 11:44:40,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:44:40,024 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 174 [2019-10-02 11:44:40,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:40,030 INFO L225 Difference]: With dead ends: 1335 [2019-10-02 11:44:40,030 INFO L226 Difference]: Without dead ends: 694 [2019-10-02 11:44:40,033 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:44:40,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-10-02 11:44:40,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-10-02 11:44:40,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-10-02 11:44:40,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1060 transitions. [2019-10-02 11:44:40,073 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1060 transitions. Word has length 174 [2019-10-02 11:44:40,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:40,074 INFO L475 AbstractCegarLoop]: Abstraction has 692 states and 1060 transitions. [2019-10-02 11:44:40,074 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:44:40,074 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1060 transitions. [2019-10-02 11:44:40,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-02 11:44:40,080 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:40,081 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:40,081 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1494364728, now seen corresponding path program 1 times [2019-10-02 11:44:40,082 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:40,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:40,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:40,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:40,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 11:44:40,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:44:40,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 11:44:40,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:44:40,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:44:40,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:44:40,275 INFO L87 Difference]: Start difference. First operand 692 states and 1060 transitions. Second operand 11 states. [2019-10-02 11:44:40,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:40,668 INFO L93 Difference]: Finished difference Result 1313 states and 2041 transitions. [2019-10-02 11:44:40,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:44:40,669 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-10-02 11:44:40,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:40,676 INFO L225 Difference]: With dead ends: 1313 [2019-10-02 11:44:40,676 INFO L226 Difference]: Without dead ends: 688 [2019-10-02 11:44:40,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:44:40,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2019-10-02 11:44:40,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 686. [2019-10-02 11:44:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-02 11:44:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1050 transitions. [2019-10-02 11:44:40,707 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1050 transitions. Word has length 175 [2019-10-02 11:44:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:40,708 INFO L475 AbstractCegarLoop]: Abstraction has 686 states and 1050 transitions. [2019-10-02 11:44:40,708 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:44:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1050 transitions. [2019-10-02 11:44:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-10-02 11:44:40,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:40,714 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:40,714 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:40,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:40,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1043612029, now seen corresponding path program 1 times [2019-10-02 11:44:40,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:40,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:40,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:40,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 11:44:41,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:41,014 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:41,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:41,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:44:41,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:44:41,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:41,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:44:41,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:44:41,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:44:41,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:44:41,601 INFO L87 Difference]: Start difference. First operand 686 states and 1050 transitions. Second operand 13 states. [2019-10-02 11:44:53,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:44:53,908 INFO L93 Difference]: Finished difference Result 1963 states and 3151 transitions. [2019-10-02 11:44:53,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:44:53,908 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 177 [2019-10-02 11:44:53,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:44:53,923 INFO L225 Difference]: With dead ends: 1963 [2019-10-02 11:44:53,923 INFO L226 Difference]: Without dead ends: 1350 [2019-10-02 11:44:53,929 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 198 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:44:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-10-02 11:44:53,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1332. [2019-10-02 11:44:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-10-02 11:44:54,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2105 transitions. [2019-10-02 11:44:54,006 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2105 transitions. Word has length 177 [2019-10-02 11:44:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:44:54,007 INFO L475 AbstractCegarLoop]: Abstraction has 1332 states and 2105 transitions. [2019-10-02 11:44:54,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:44:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2105 transitions. [2019-10-02 11:44:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-10-02 11:44:54,013 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:44:54,013 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:44:54,014 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:44:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:44:54,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1714775101, now seen corresponding path program 1 times [2019-10-02 11:44:54,014 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:44:54,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:44:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:54,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:44:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 11:44:54,232 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:44:54,232 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:44:54,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:44:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:44:54,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 3017 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:44:54,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:44:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:44:54,875 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:44:54,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:44:54,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:44:54,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:44:54,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:44:54,878 INFO L87 Difference]: Start difference. First operand 1332 states and 2105 transitions. Second operand 13 states. [2019-10-02 11:45:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:06,673 INFO L93 Difference]: Finished difference Result 3296 states and 5352 transitions. [2019-10-02 11:45:06,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 11:45:06,673 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 182 [2019-10-02 11:45:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:06,689 INFO L225 Difference]: With dead ends: 3296 [2019-10-02 11:45:06,689 INFO L226 Difference]: Without dead ends: 2037 [2019-10-02 11:45:06,697 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 203 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-10-02 11:45:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2037 states. [2019-10-02 11:45:06,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2037 to 2005. [2019-10-02 11:45:06,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2005 states. [2019-10-02 11:45:06,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 3206 transitions. [2019-10-02 11:45:06,800 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 3206 transitions. Word has length 182 [2019-10-02 11:45:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:06,800 INFO L475 AbstractCegarLoop]: Abstraction has 2005 states and 3206 transitions. [2019-10-02 11:45:06,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:45:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 3206 transitions. [2019-10-02 11:45:06,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 11:45:06,805 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:06,806 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:06,806 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:06,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:06,806 INFO L82 PathProgramCache]: Analyzing trace with hash 151870904, now seen corresponding path program 1 times [2019-10-02 11:45:06,807 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:06,807 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:06,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:06,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:06,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:07,003 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-02 11:45:07,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:07,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:45:07,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:45:07,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:45:07,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:45:07,015 INFO L87 Difference]: Start difference. First operand 2005 states and 3206 transitions. Second operand 7 states. [2019-10-02 11:45:07,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:07,118 INFO L93 Difference]: Finished difference Result 3961 states and 6387 transitions. [2019-10-02 11:45:07,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:45:07,118 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 183 [2019-10-02 11:45:07,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:07,135 INFO L225 Difference]: With dead ends: 3961 [2019-10-02 11:45:07,136 INFO L226 Difference]: Without dead ends: 2029 [2019-10-02 11:45:07,147 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:45:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-10-02 11:45:07,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2011. [2019-10-02 11:45:07,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-10-02 11:45:07,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 3212 transitions. [2019-10-02 11:45:07,252 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 3212 transitions. Word has length 183 [2019-10-02 11:45:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:07,253 INFO L475 AbstractCegarLoop]: Abstraction has 2011 states and 3212 transitions. [2019-10-02 11:45:07,253 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:45:07,254 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 3212 transitions. [2019-10-02 11:45:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-02 11:45:07,259 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:07,260 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:07,260 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:07,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:07,260 INFO L82 PathProgramCache]: Analyzing trace with hash 126672829, now seen corresponding path program 1 times [2019-10-02 11:45:07,260 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:07,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:07,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:07,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:07,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:07,449 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:45:07,449 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:07,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:45:07,450 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:45:07,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:45:07,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:45:07,451 INFO L87 Difference]: Start difference. First operand 2011 states and 3212 transitions. Second operand 6 states. [2019-10-02 11:45:08,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:08,147 INFO L93 Difference]: Finished difference Result 3979 states and 6469 transitions. [2019-10-02 11:45:08,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:45:08,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-10-02 11:45:08,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:08,162 INFO L225 Difference]: With dead ends: 3979 [2019-10-02 11:45:08,162 INFO L226 Difference]: Without dead ends: 2029 [2019-10-02 11:45:08,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:08,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2029 states. [2019-10-02 11:45:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2029 to 2029. [2019-10-02 11:45:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2029 states. [2019-10-02 11:45:08,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 3215 transitions. [2019-10-02 11:45:08,269 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 3215 transitions. Word has length 181 [2019-10-02 11:45:08,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:08,270 INFO L475 AbstractCegarLoop]: Abstraction has 2029 states and 3215 transitions. [2019-10-02 11:45:08,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:45:08,270 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 3215 transitions. [2019-10-02 11:45:08,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-02 11:45:08,277 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:08,277 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:08,277 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:08,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:08,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1249050027, now seen corresponding path program 1 times [2019-10-02 11:45:08,278 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:08,278 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:08,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:08,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:08,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:08,605 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-02 11:45:08,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:08,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:45:08,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:45:08,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:45:08,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:45:08,607 INFO L87 Difference]: Start difference. First operand 2029 states and 3215 transitions. Second operand 6 states. [2019-10-02 11:45:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:09,348 INFO L93 Difference]: Finished difference Result 4018 states and 6472 transitions. [2019-10-02 11:45:09,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:45:09,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-10-02 11:45:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:09,364 INFO L225 Difference]: With dead ends: 4018 [2019-10-02 11:45:09,364 INFO L226 Difference]: Without dead ends: 2050 [2019-10-02 11:45:09,374 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:45:09,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states. [2019-10-02 11:45:09,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 2050. [2019-10-02 11:45:09,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2019-10-02 11:45:09,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 3221 transitions. [2019-10-02 11:45:09,473 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 3221 transitions. Word has length 183 [2019-10-02 11:45:09,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:09,474 INFO L475 AbstractCegarLoop]: Abstraction has 2050 states and 3221 transitions. [2019-10-02 11:45:09,474 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:45:09,474 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 3221 transitions. [2019-10-02 11:45:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-02 11:45:09,479 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:09,479 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:09,479 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:09,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:09,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1836956669, now seen corresponding path program 1 times [2019-10-02 11:45:09,480 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:09,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:09,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:09,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:09,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:45:09,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:09,704 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:09,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:10,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 3021 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-02 11:45:10,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:10,335 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:45:10,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:10,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-10-02 11:45:10,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:45:10,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:45:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:45:10,345 INFO L87 Difference]: Start difference. First operand 2050 states and 3221 transitions. Second operand 13 states. [2019-10-02 11:45:28,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:28,566 INFO L93 Difference]: Finished difference Result 10649 states and 17236 transitions. [2019-10-02 11:45:28,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-10-02 11:45:28,572 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 185 [2019-10-02 11:45:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:28,628 INFO L225 Difference]: With dead ends: 10649 [2019-10-02 11:45:28,628 INFO L226 Difference]: Without dead ends: 8672 [2019-10-02 11:45:28,638 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2019-10-02 11:45:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8672 states. [2019-10-02 11:45:29,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8672 to 8484. [2019-10-02 11:45:29,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8484 states. [2019-10-02 11:45:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 13638 transitions. [2019-10-02 11:45:29,107 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 13638 transitions. Word has length 185 [2019-10-02 11:45:29,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:29,108 INFO L475 AbstractCegarLoop]: Abstraction has 8484 states and 13638 transitions. [2019-10-02 11:45:29,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:45:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 13638 transitions. [2019-10-02 11:45:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 11:45:29,118 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:29,118 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:29,118 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:29,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2141733945, now seen corresponding path program 1 times [2019-10-02 11:45:29,119 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:29,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-02 11:45:29,293 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:45:29,293 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:45:29,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:29,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 3038 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 11:45:29,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:45:29,969 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-02 11:45:29,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:45:29,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2019-10-02 11:45:29,986 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:45:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:45:29,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:45:29,987 INFO L87 Difference]: Start difference. First operand 8484 states and 13638 transitions. Second operand 12 states. [2019-10-02 11:45:30,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:30,531 INFO L93 Difference]: Finished difference Result 13778 states and 22105 transitions. [2019-10-02 11:45:30,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:45:30,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 191 [2019-10-02 11:45:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:30,573 INFO L225 Difference]: With dead ends: 13778 [2019-10-02 11:45:30,574 INFO L226 Difference]: Without dead ends: 5335 [2019-10-02 11:45:30,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:45:30,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5335 states. [2019-10-02 11:45:30,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5335 to 5323. [2019-10-02 11:45:30,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5323 states. [2019-10-02 11:45:30,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5323 states to 5323 states and 8466 transitions. [2019-10-02 11:45:30,850 INFO L78 Accepts]: Start accepts. Automaton has 5323 states and 8466 transitions. Word has length 191 [2019-10-02 11:45:30,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:30,851 INFO L475 AbstractCegarLoop]: Abstraction has 5323 states and 8466 transitions. [2019-10-02 11:45:30,851 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:45:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 5323 states and 8466 transitions. [2019-10-02 11:45:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 11:45:30,857 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:30,857 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:30,857 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:30,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:30,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1872738926, now seen corresponding path program 1 times [2019-10-02 11:45:30,858 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:30,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:30,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:30,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:30,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:30,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:31,046 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-02 11:45:31,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:31,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:45:31,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:45:31,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:45:31,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:45:31,048 INFO L87 Difference]: Start difference. First operand 5323 states and 8466 transitions. Second operand 10 states. [2019-10-02 11:45:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:40,409 INFO L93 Difference]: Finished difference Result 10613 states and 16974 transitions. [2019-10-02 11:45:40,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 11:45:40,410 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 201 [2019-10-02 11:45:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:40,439 INFO L225 Difference]: With dead ends: 10613 [2019-10-02 11:45:40,439 INFO L226 Difference]: Without dead ends: 5363 [2019-10-02 11:45:40,456 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2019-10-02 11:45:40,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5363 states. [2019-10-02 11:45:40,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5363 to 5269. [2019-10-02 11:45:40,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5269 states. [2019-10-02 11:45:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 8368 transitions. [2019-10-02 11:45:40,701 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 8368 transitions. Word has length 201 [2019-10-02 11:45:40,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:40,702 INFO L475 AbstractCegarLoop]: Abstraction has 5269 states and 8368 transitions. [2019-10-02 11:45:40,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:45:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 8368 transitions. [2019-10-02 11:45:40,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-10-02 11:45:40,711 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:40,712 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:45:40,712 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:40,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1883226933, now seen corresponding path program 1 times [2019-10-02 11:45:40,713 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:40,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:40,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:40,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:40,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:40,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:45:40,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:40,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:45:40,855 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:45:40,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:45:40,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:40,855 INFO L87 Difference]: Start difference. First operand 5269 states and 8368 transitions. Second operand 4 states. [2019-10-02 11:45:42,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:42,189 INFO L93 Difference]: Finished difference Result 15500 states and 25153 transitions. [2019-10-02 11:45:42,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:45:42,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 215 [2019-10-02 11:45:42,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:42,248 INFO L225 Difference]: With dead ends: 15500 [2019-10-02 11:45:42,248 INFO L226 Difference]: Without dead ends: 10304 [2019-10-02 11:45:42,272 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:42,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10304 states. [2019-10-02 11:45:42,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10304 to 10300. [2019-10-02 11:45:42,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10300 states. [2019-10-02 11:45:42,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10300 states to 10300 states and 16429 transitions. [2019-10-02 11:45:42,799 INFO L78 Accepts]: Start accepts. Automaton has 10300 states and 16429 transitions. Word has length 215 [2019-10-02 11:45:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:42,800 INFO L475 AbstractCegarLoop]: Abstraction has 10300 states and 16429 transitions. [2019-10-02 11:45:42,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:45:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 10300 states and 16429 transitions. [2019-10-02 11:45:42,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-10-02 11:45:42,815 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:42,818 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:42,819 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:42,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:42,819 INFO L82 PathProgramCache]: Analyzing trace with hash -2077627384, now seen corresponding path program 1 times [2019-10-02 11:45:42,819 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:42,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:42,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:42,833 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:42,833 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:42,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:45:43,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:43,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:45:43,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:45:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:45:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:43,005 INFO L87 Difference]: Start difference. First operand 10300 states and 16429 transitions. Second operand 4 states. [2019-10-02 11:45:44,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:44,711 INFO L93 Difference]: Finished difference Result 30633 states and 50110 transitions. [2019-10-02 11:45:44,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:45:44,711 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 216 [2019-10-02 11:45:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:44,850 INFO L225 Difference]: With dead ends: 30633 [2019-10-02 11:45:44,850 INFO L226 Difference]: Without dead ends: 20406 [2019-10-02 11:45:44,901 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:44,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20406 states. [2019-10-02 11:45:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20406 to 20402. [2019-10-02 11:45:45,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20402 states. [2019-10-02 11:45:45,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20402 states to 20402 states and 32848 transitions. [2019-10-02 11:45:45,769 INFO L78 Accepts]: Start accepts. Automaton has 20402 states and 32848 transitions. Word has length 216 [2019-10-02 11:45:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:45,770 INFO L475 AbstractCegarLoop]: Abstraction has 20402 states and 32848 transitions. [2019-10-02 11:45:45,770 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:45:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 20402 states and 32848 transitions. [2019-10-02 11:45:45,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 11:45:45,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:45,777 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:45:45,777 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:45,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:45,778 INFO L82 PathProgramCache]: Analyzing trace with hash -681877607, now seen corresponding path program 1 times [2019-10-02 11:45:45,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:45,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:45,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:45,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:45,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:45,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:45:45,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:45,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:45:45,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:45:45,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:45:45,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:45,917 INFO L87 Difference]: Start difference. First operand 20402 states and 32848 transitions. Second operand 4 states. [2019-10-02 11:45:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:48,232 INFO L93 Difference]: Finished difference Result 60979 states and 101382 transitions. [2019-10-02 11:45:48,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:45:48,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-10-02 11:45:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:48,523 INFO L225 Difference]: With dead ends: 60979 [2019-10-02 11:45:48,523 INFO L226 Difference]: Without dead ends: 40650 [2019-10-02 11:45:48,641 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:48,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40650 states. [2019-10-02 11:45:51,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40650 to 40646. [2019-10-02 11:45:51,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40646 states. [2019-10-02 11:45:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40646 states to 40646 states and 66437 transitions. [2019-10-02 11:45:51,413 INFO L78 Accepts]: Start accepts. Automaton has 40646 states and 66437 transitions. Word has length 217 [2019-10-02 11:45:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:45:51,414 INFO L475 AbstractCegarLoop]: Abstraction has 40646 states and 66437 transitions. [2019-10-02 11:45:51,414 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:45:51,414 INFO L276 IsEmpty]: Start isEmpty. Operand 40646 states and 66437 transitions. [2019-10-02 11:45:51,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 11:45:51,421 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:45:51,421 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:45:51,422 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:45:51,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:45:51,422 INFO L82 PathProgramCache]: Analyzing trace with hash -735125460, now seen corresponding path program 1 times [2019-10-02 11:45:51,422 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:45:51,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:45:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:51,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:45:51,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:45:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:45:51,554 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:45:51,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:45:51,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:45:51,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:45:51,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:45:51,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:51,556 INFO L87 Difference]: Start difference. First operand 40646 states and 66437 transitions. Second operand 4 states. [2019-10-02 11:45:55,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:45:55,679 INFO L93 Difference]: Finished difference Result 121751 states and 207958 transitions. [2019-10-02 11:45:55,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:45:55,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 218 [2019-10-02 11:45:55,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:45:56,149 INFO L225 Difference]: With dead ends: 121751 [2019-10-02 11:45:56,150 INFO L226 Difference]: Without dead ends: 81178 [2019-10-02 11:45:56,308 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:45:56,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81178 states. [2019-10-02 11:46:01,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81178 to 81174. [2019-10-02 11:46:01,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81174 states. [2019-10-02 11:46:02,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81174 states to 81174 states and 135842 transitions. [2019-10-02 11:46:02,016 INFO L78 Accepts]: Start accepts. Automaton has 81174 states and 135842 transitions. Word has length 218 [2019-10-02 11:46:02,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:02,017 INFO L475 AbstractCegarLoop]: Abstraction has 81174 states and 135842 transitions. [2019-10-02 11:46:02,017 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:46:02,017 INFO L276 IsEmpty]: Start isEmpty. Operand 81174 states and 135842 transitions. [2019-10-02 11:46:02,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 11:46:02,022 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:02,022 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:02,022 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:02,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:02,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1537340413, now seen corresponding path program 1 times [2019-10-02 11:46:02,023 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:02,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:02,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:02,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:46:02,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:02,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:46:02,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:46:02,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:46:02,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:46:02,204 INFO L87 Difference]: Start difference. First operand 81174 states and 135842 transitions. Second operand 4 states. [2019-10-02 11:46:13,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:13,774 INFO L93 Difference]: Finished difference Result 243375 states and 433832 transitions. [2019-10-02 11:46:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:46:13,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-10-02 11:46:13,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:14,546 INFO L225 Difference]: With dead ends: 243375 [2019-10-02 11:46:14,546 INFO L226 Difference]: Without dead ends: 162274 [2019-10-02 11:46:14,863 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:46:14,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162274 states. [2019-10-02 11:46:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162274 to 162270. [2019-10-02 11:46:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162270 states. [2019-10-02 11:46:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162270 states to 162270 states and 281613 transitions. [2019-10-02 11:46:25,771 INFO L78 Accepts]: Start accepts. Automaton has 162270 states and 281613 transitions. Word has length 219 [2019-10-02 11:46:25,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:25,772 INFO L475 AbstractCegarLoop]: Abstraction has 162270 states and 281613 transitions. [2019-10-02 11:46:25,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:46:25,772 INFO L276 IsEmpty]: Start isEmpty. Operand 162270 states and 281613 transitions. [2019-10-02 11:46:25,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-02 11:46:25,777 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:25,777 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:46:25,778 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:25,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:25,778 INFO L82 PathProgramCache]: Analyzing trace with hash 370644094, now seen corresponding path program 1 times [2019-10-02 11:46:25,778 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:25,778 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:25,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:25,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:25,949 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 11:46:25,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:25,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:46:25,950 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:46:25,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:46:25,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:46:25,951 INFO L87 Difference]: Start difference. First operand 162270 states and 281613 transitions. Second operand 9 states. [2019-10-02 11:46:38,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:46:38,486 INFO L93 Difference]: Finished difference Result 327384 states and 567303 transitions. [2019-10-02 11:46:38,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 11:46:38,998 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 219 [2019-10-02 11:46:38,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:46:39,877 INFO L225 Difference]: With dead ends: 327384 [2019-10-02 11:46:39,877 INFO L226 Difference]: Without dead ends: 165218 [2019-10-02 11:46:40,468 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:46:40,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165218 states. [2019-10-02 11:46:53,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165218 to 163550. [2019-10-02 11:46:53,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163550 states. [2019-10-02 11:46:54,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163550 states to 163550 states and 283149 transitions. [2019-10-02 11:46:54,732 INFO L78 Accepts]: Start accepts. Automaton has 163550 states and 283149 transitions. Word has length 219 [2019-10-02 11:46:54,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:46:54,732 INFO L475 AbstractCegarLoop]: Abstraction has 163550 states and 283149 transitions. [2019-10-02 11:46:54,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:46:54,733 INFO L276 IsEmpty]: Start isEmpty. Operand 163550 states and 283149 transitions. [2019-10-02 11:46:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 11:46:54,741 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:46:54,742 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:46:54,742 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:46:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:46:54,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1467597845, now seen corresponding path program 1 times [2019-10-02 11:46:54,743 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:46:54,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:46:54,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:54,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:46:54,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:46:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:46:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:46:54,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:46:54,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:46:54,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:46:54,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:46:54,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:46:54,918 INFO L87 Difference]: Start difference. First operand 163550 states and 283149 transitions. Second operand 9 states. [2019-10-02 11:47:03,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:03,644 INFO L93 Difference]: Finished difference Result 331348 states and 573578 transitions. [2019-10-02 11:47:03,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:47:03,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 225 [2019-10-02 11:47:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:04,662 INFO L225 Difference]: With dead ends: 331348 [2019-10-02 11:47:04,662 INFO L226 Difference]: Without dead ends: 167902 [2019-10-02 11:47:12,066 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:47:12,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167902 states. [2019-10-02 11:47:18,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167902 to 166878. [2019-10-02 11:47:18,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166878 states. [2019-10-02 11:47:19,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166878 states to 166878 states and 288465 transitions. [2019-10-02 11:47:19,845 INFO L78 Accepts]: Start accepts. Automaton has 166878 states and 288465 transitions. Word has length 225 [2019-10-02 11:47:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:47:19,846 INFO L475 AbstractCegarLoop]: Abstraction has 166878 states and 288465 transitions. [2019-10-02 11:47:19,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:47:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 166878 states and 288465 transitions. [2019-10-02 11:47:19,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-02 11:47:19,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:47:19,853 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:47:19,853 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:47:19,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:47:19,853 INFO L82 PathProgramCache]: Analyzing trace with hash -2103411128, now seen corresponding path program 1 times [2019-10-02 11:47:19,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:47:19,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:47:19,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:19,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:47:19,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:19,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:47:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:47:20,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:47:20,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:47:20,014 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:47:20,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:47:20,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:47:20,015 INFO L87 Difference]: Start difference. First operand 166878 states and 288465 transitions. Second operand 9 states. [2019-10-02 11:47:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:47:37,291 INFO L93 Difference]: Finished difference Result 336724 states and 581134 transitions. [2019-10-02 11:47:37,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 11:47:37,291 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 224 [2019-10-02 11:47:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:47:38,070 INFO L225 Difference]: With dead ends: 336724 [2019-10-02 11:47:38,071 INFO L226 Difference]: Without dead ends: 169950 [2019-10-02 11:47:38,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:47:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169950 states. [2019-10-02 11:47:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169950 to 167134. [2019-10-02 11:47:45,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167134 states. [2019-10-02 11:47:53,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167134 states to 167134 states and 288721 transitions. [2019-10-02 11:47:53,442 INFO L78 Accepts]: Start accepts. Automaton has 167134 states and 288721 transitions. Word has length 224 [2019-10-02 11:47:53,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:47:53,443 INFO L475 AbstractCegarLoop]: Abstraction has 167134 states and 288721 transitions. [2019-10-02 11:47:53,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:47:53,443 INFO L276 IsEmpty]: Start isEmpty. Operand 167134 states and 288721 transitions. [2019-10-02 11:47:53,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-02 11:47:53,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:47:53,450 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:47:53,450 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:47:53,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:47:53,450 INFO L82 PathProgramCache]: Analyzing trace with hash -910162345, now seen corresponding path program 1 times [2019-10-02 11:47:53,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:47:53,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:47:53,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:53,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:47:53,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:47:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:47:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-10-02 11:47:53,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:47:53,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 11:47:53,588 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 11:47:53,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 11:47:53,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:47:53,589 INFO L87 Difference]: Start difference. First operand 167134 states and 288721 transitions. Second operand 5 states. [2019-10-02 11:48:01,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:01,808 INFO L93 Difference]: Finished difference Result 335384 states and 577902 transitions. [2019-10-02 11:48:01,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:48:01,809 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 225 [2019-10-02 11:48:01,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:03,619 INFO L225 Difference]: With dead ends: 335384 [2019-10-02 11:48:03,619 INFO L226 Difference]: Without dead ends: 168354 [2019-10-02 11:48:04,214 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 11:48:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168354 states. [2019-10-02 11:48:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168354 to 167114. [2019-10-02 11:48:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167114 states. [2019-10-02 11:48:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167114 states to 167114 states and 288673 transitions. [2019-10-02 11:48:21,802 INFO L78 Accepts]: Start accepts. Automaton has 167114 states and 288673 transitions. Word has length 225 [2019-10-02 11:48:21,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:48:21,803 INFO L475 AbstractCegarLoop]: Abstraction has 167114 states and 288673 transitions. [2019-10-02 11:48:21,803 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 11:48:21,803 INFO L276 IsEmpty]: Start isEmpty. Operand 167114 states and 288673 transitions. [2019-10-02 11:48:21,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 11:48:21,808 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:48:21,808 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:48:21,808 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:48:21,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:48:21,809 INFO L82 PathProgramCache]: Analyzing trace with hash 893874517, now seen corresponding path program 1 times [2019-10-02 11:48:21,809 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:48:21,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:48:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:21,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:48:21,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:48:21,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:48:21,945 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-10-02 11:48:21,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:48:21,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:48:21,947 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:48:21,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:48:21,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:21,947 INFO L87 Difference]: Start difference. First operand 167114 states and 288673 transitions. Second operand 4 states. [2019-10-02 11:48:47,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:48:47,876 INFO L93 Difference]: Finished difference Result 582759 states and 1015422 transitions. [2019-10-02 11:48:47,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:48:47,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-10-02 11:48:47,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:48:50,035 INFO L225 Difference]: With dead ends: 582759 [2019-10-02 11:48:50,036 INFO L226 Difference]: Without dead ends: 415493 [2019-10-02 11:48:52,329 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:48:52,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415493 states. [2019-10-02 11:49:27,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415493 to 414717. [2019-10-02 11:49:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414717 states. [2019-10-02 11:49:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414717 states to 414717 states and 712350 transitions. [2019-10-02 11:49:32,546 INFO L78 Accepts]: Start accepts. Automaton has 414717 states and 712350 transitions. Word has length 233 [2019-10-02 11:49:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:49:32,547 INFO L475 AbstractCegarLoop]: Abstraction has 414717 states and 712350 transitions. [2019-10-02 11:49:32,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:49:32,547 INFO L276 IsEmpty]: Start isEmpty. Operand 414717 states and 712350 transitions. [2019-10-02 11:49:32,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-02 11:49:32,553 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:49:32,553 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:49:32,553 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:49:32,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:49:32,553 INFO L82 PathProgramCache]: Analyzing trace with hash 881838575, now seen corresponding path program 1 times [2019-10-02 11:49:32,554 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:49:32,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:49:32,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:32,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:49:32,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:49:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:49:32,728 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2019-10-02 11:49:32,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:49:32,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:49:32,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:49:32,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:49:32,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:49:32,729 INFO L87 Difference]: Start difference. First operand 414717 states and 712350 transitions. Second operand 9 states. [2019-10-02 11:50:07,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:50:07,553 INFO L93 Difference]: Finished difference Result 773589 states and 1322667 transitions. [2019-10-02 11:50:07,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:50:07,553 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 282 [2019-10-02 11:50:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:50:11,091 INFO L225 Difference]: With dead ends: 773589 [2019-10-02 11:50:11,092 INFO L226 Difference]: Without dead ends: 416641 [2019-10-02 11:50:14,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:50:14,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416641 states. [2019-10-02 11:50:55,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416641 to 414717. [2019-10-02 11:50:55,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414717 states. [2019-10-02 11:51:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414717 states to 414717 states and 711966 transitions. [2019-10-02 11:51:01,723 INFO L78 Accepts]: Start accepts. Automaton has 414717 states and 711966 transitions. Word has length 282 [2019-10-02 11:51:01,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:51:01,723 INFO L475 AbstractCegarLoop]: Abstraction has 414717 states and 711966 transitions. [2019-10-02 11:51:01,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:51:01,724 INFO L276 IsEmpty]: Start isEmpty. Operand 414717 states and 711966 transitions. [2019-10-02 11:51:01,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2019-10-02 11:51:01,729 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:51:01,729 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:51:01,729 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:51:01,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:51:01,729 INFO L82 PathProgramCache]: Analyzing trace with hash -810522826, now seen corresponding path program 1 times [2019-10-02 11:51:01,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:51:01,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:51:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:01,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:51:01,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:51:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:51:01,979 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-10-02 11:51:01,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:51:01,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-10-02 11:51:01,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 11:51:01,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 11:51:01,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:51:01,981 INFO L87 Difference]: Start difference. First operand 414717 states and 711966 transitions. Second operand 14 states. [2019-10-02 11:51:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:51:35,109 INFO L93 Difference]: Finished difference Result 764551 states and 1316798 transitions. [2019-10-02 11:51:35,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:51:35,109 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 280 [2019-10-02 11:51:35,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:51:38,477 INFO L225 Difference]: With dead ends: 764551 [2019-10-02 11:51:38,478 INFO L226 Difference]: Without dead ends: 423715 [2019-10-02 11:51:55,025 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:51:55,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423715 states. [2019-10-02 11:52:14,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423715 to 422563. [2019-10-02 11:52:14,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422563 states. [2019-10-02 11:52:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422563 states to 422563 states and 726515 transitions. [2019-10-02 11:52:34,708 INFO L78 Accepts]: Start accepts. Automaton has 422563 states and 726515 transitions. Word has length 280 [2019-10-02 11:52:34,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:52:34,709 INFO L475 AbstractCegarLoop]: Abstraction has 422563 states and 726515 transitions. [2019-10-02 11:52:34,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 11:52:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 422563 states and 726515 transitions. [2019-10-02 11:52:34,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-02 11:52:34,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:52:34,714 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:52:34,714 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:52:34,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:52:34,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2002970989, now seen corresponding path program 1 times [2019-10-02 11:52:34,715 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:52:34,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:52:34,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:34,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:52:34,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:52:34,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:52:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 11:52:34,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:52:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 11:52:34,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 11:52:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 11:52:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 11:52:34,875 INFO L87 Difference]: Start difference. First operand 422563 states and 726515 transitions. Second operand 8 states. [2019-10-02 11:53:17,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:53:17,529 INFO L93 Difference]: Finished difference Result 811937 states and 1407675 transitions. [2019-10-02 11:53:17,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:53:17,530 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 236 [2019-10-02 11:53:17,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:53:21,566 INFO L225 Difference]: With dead ends: 811937 [2019-10-02 11:53:21,566 INFO L226 Difference]: Without dead ends: 447335 [2019-10-02 11:53:40,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:53:40,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447335 states. [2019-10-02 11:54:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447335 to 425315. [2019-10-02 11:54:00,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425315 states. [2019-10-02 11:54:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425315 states to 425315 states and 729699 transitions. [2019-10-02 11:54:05,193 INFO L78 Accepts]: Start accepts. Automaton has 425315 states and 729699 transitions. Word has length 236 [2019-10-02 11:54:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:05,194 INFO L475 AbstractCegarLoop]: Abstraction has 425315 states and 729699 transitions. [2019-10-02 11:54:05,194 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 11:54:05,194 INFO L276 IsEmpty]: Start isEmpty. Operand 425315 states and 729699 transitions. [2019-10-02 11:54:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-10-02 11:54:05,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:05,199 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 11:54:05,199 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:05,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:05,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1051397964, now seen corresponding path program 1 times [2019-10-02 11:54:05,200 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:05,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:05,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:05,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:05,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:06,880 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-02 11:54:06,881 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:06,881 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:54:07,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:07,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 3376 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:54:07,505 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:07,564 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-10-02 11:54:07,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:54:07,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:54:07,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:54:07,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:54:07,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:07,583 INFO L87 Difference]: Start difference. First operand 425315 states and 729699 transitions. Second operand 9 states.