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_product32.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:34:59,279 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:34:59,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:34:59,293 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:34:59,293 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:34:59,294 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:34:59,295 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:34:59,297 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:34:59,299 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:34:59,300 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:34:59,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:34:59,302 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:34:59,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:34:59,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:34:59,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:34:59,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:34:59,305 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:34:59,306 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:34:59,308 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:34:59,309 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:34:59,311 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:34:59,312 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:34:59,313 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:34:59,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:34:59,315 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:34:59,316 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:34:59,316 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:34:59,317 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:34:59,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:34:59,318 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:34:59,318 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:34:59,319 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:34:59,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:34:59,320 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:34:59,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:34:59,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:34:59,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:34:59,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:34:59,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:34:59,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:34:59,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:34:59,324 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:34:59,338 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:34:59,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:34:59,339 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:34:59,339 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:34:59,340 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:34:59,340 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:34:59,340 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:34:59,340 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:34:59,340 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:34:59,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:34:59,341 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:34:59,341 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:34:59,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:34:59,341 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:34:59,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:34:59,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:34:59,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:34:59,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:34:59,342 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:34:59,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:34:59,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:34:59,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:34:59,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:34:59,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:34:59,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:34:59,344 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:34:59,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:34:59,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:34:59,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:34:59,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:34:59,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:34:59,387 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:34:59,388 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:34:59,389 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:34:59,389 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec13_product32.cil.c [2019-09-08 03:34:59,457 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfdfc3774/eff44438c4e2444d8845a1d9c482ddd2/FLAGdd96b97cc [2019-09-08 03:35:00,024 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:35:00,025 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec13_product32.cil.c [2019-09-08 03:35:00,058 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfdfc3774/eff44438c4e2444d8845a1d9c482ddd2/FLAGdd96b97cc [2019-09-08 03:35:00,265 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfdfc3774/eff44438c4e2444d8845a1d9c482ddd2 [2019-09-08 03:35:00,275 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:35:00,277 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:35:00,277 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:35:00,278 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:35:00,281 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:35:00,282 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:35:00" (1/1) ... [2019-09-08 03:35:00,285 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5eccc939 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:00, skipping insertion in model container [2019-09-08 03:35:00,285 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:35:00" (1/1) ... [2019-09-08 03:35:00,292 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:35:00,376 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:35:01,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:35:01,105 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:35:01,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:35:01,318 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:35:01,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01 WrapperNode [2019-09-08 03:35:01,319 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:35:01,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:35:01,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:35:01,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:35:01,334 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (1/1) ... [2019-09-08 03:35:01,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (1/1) ... [2019-09-08 03:35:01,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (1/1) ... [2019-09-08 03:35:01,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (1/1) ... [2019-09-08 03:35:01,429 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (1/1) ... [2019-09-08 03:35:01,465 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (1/1) ... [2019-09-08 03:35:01,475 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (1/1) ... [2019-09-08 03:35:01,492 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:35:01,492 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:35:01,493 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:35:01,493 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:35:01,494 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:35:01,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:35:01,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:35:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:35:01,600 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:35:01,601 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:35:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:35:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__1 [2019-09-08 03:35:01,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification13_spec__2 [2019-09-08 03:35:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:35:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:35:01,603 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:35:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:35:01,604 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:35:01,605 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:35:01,606 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:35:01,607 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:35:01,609 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:35:01,610 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:35:01,610 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:35:01,611 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:35:01,611 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:35:01,611 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:35:01,612 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:35:01,612 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:35:01,612 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:35:01,612 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:35:01,613 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:35:01,613 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:35:01,613 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:35:01,614 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:35:01,614 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:35:01,614 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:35:01,615 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:35:01,615 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:35:01,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:35:01,616 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:35:01,616 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:35:01,616 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:35:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:35:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:35:01,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:35:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:35:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:35:01,618 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:35:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:35:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:35:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:35:01,619 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:35:01,620 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:35:01,620 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:35:01,620 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:35:01,620 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:35:01,621 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 03:35:01,621 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:35:01,621 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:35:01,622 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:35:01,622 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:35:01,622 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:35:01,622 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:35:01,623 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:35:01,623 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:35:01,623 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:35:01,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:35:01,624 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:35:01,624 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 03:35:01,625 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:35:01,625 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:35:01,625 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:35:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:35:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 03:35:01,626 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:35:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:35:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:35:01,627 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-09-08 03:35:01,628 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:35:01,628 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-09-08 03:35:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:35:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:35:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:35:01,629 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:35:01,630 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:35:01,630 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:35:01,631 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:35:01,631 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:35:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:35:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:35:01,632 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:35:01,633 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:35:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:35:01,634 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:35:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:35:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:35:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:35:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:35:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__1 [2019-09-08 03:35:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:35:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification13_spec__2 [2019-09-08 03:35:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:35:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:35:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:35:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:35:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:35:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:35:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:35:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:35:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:35:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:35:01,638 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:35:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:35:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:35:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:35:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:35:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:35:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:35:01,639 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:35:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:35:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:35:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:35:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:35:01,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:35:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:35:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:35:01,641 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:35:01,642 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:35:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:35:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:35:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:35:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:35:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:35:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:35:01,643 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:35:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:35:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:35:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:35:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:35:01,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:35:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:35:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:35:01,645 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:35:01,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:35:01,649 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:35:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:35:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:35:01,650 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:35:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:35:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:35:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:35:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:35:01,659 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:35:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:35:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:35:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:35:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:35:01,660 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:35:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:35:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:35:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:35:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:35:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 03:35:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:35:01,661 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:35:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:35:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:35:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 03:35:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 03:35:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:35:01,662 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:35:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 03:35:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 03:35:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:35:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:35:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:35:01,663 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-09-08 03:35:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-09-08 03:35:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:35:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:35:01,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:35:04,276 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:35:04,277 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:35:04,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:35:04 BoogieIcfgContainer [2019-09-08 03:35:04,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:35:04,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:35:04,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:35:04,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:35:04,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:35:00" (1/3) ... [2019-09-08 03:35:04,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3234715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:35:04, skipping insertion in model container [2019-09-08 03:35:04,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:35:01" (2/3) ... [2019-09-08 03:35:04,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3234715c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:35:04, skipping insertion in model container [2019-09-08 03:35:04,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:35:04" (3/3) ... [2019-09-08 03:35:04,291 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec13_product32.cil.c [2019-09-08 03:35:04,302 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:35:04,313 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:35:04,329 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:35:04,376 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:35:04,377 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:35:04,377 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:35:04,377 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:35:04,377 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:35:04,378 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:35:04,378 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:35:04,378 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:35:04,378 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:35:04,423 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states. [2019-09-08 03:35:04,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 03:35:04,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:04,456 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:04,459 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:04,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:04,465 INFO L82 PathProgramCache]: Analyzing trace with hash -2027146740, now seen corresponding path program 1 times [2019-09-08 03:35:04,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:04,467 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:04,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:04,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:04,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 03:35:05,203 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:05,203 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:35:05,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:05,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:05,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:35:05,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:05,875 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:35:05,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:05,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 7 [2019-09-08 03:35:05,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:35:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:35:05,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:35:05,915 INFO L87 Difference]: Start difference. First operand 851 states. Second operand 7 states. [2019-09-08 03:35:06,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:06,250 INFO L93 Difference]: Finished difference Result 1398 states and 2240 transitions. [2019-09-08 03:35:06,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:35:06,252 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2019-09-08 03:35:06,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:06,290 INFO L225 Difference]: With dead ends: 1398 [2019-09-08 03:35:06,290 INFO L226 Difference]: Without dead ends: 702 [2019-09-08 03:35:06,303 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:35:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2019-09-08 03:35:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 702. [2019-09-08 03:35:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 702 states. [2019-09-08 03:35:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 702 states to 702 states and 1101 transitions. [2019-09-08 03:35:06,435 INFO L78 Accepts]: Start accepts. Automaton has 702 states and 1101 transitions. Word has length 113 [2019-09-08 03:35:06,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:06,436 INFO L475 AbstractCegarLoop]: Abstraction has 702 states and 1101 transitions. [2019-09-08 03:35:06,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:35:06,436 INFO L276 IsEmpty]: Start isEmpty. Operand 702 states and 1101 transitions. [2019-09-08 03:35:06,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 03:35:06,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:06,440 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:06,441 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:06,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:06,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1088965156, now seen corresponding path program 1 times [2019-09-08 03:35:06,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:06,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:06,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:06,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:06,720 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:35:06,721 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:06,721 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:06,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:07,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 2886 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:35:07,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:07,269 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:35:07,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:07,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:35:07,286 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:35:07,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:35:07,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:35:07,287 INFO L87 Difference]: Start difference. First operand 702 states and 1101 transitions. Second operand 9 states. [2019-09-08 03:35:08,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:08,149 INFO L93 Difference]: Finished difference Result 1427 states and 2271 transitions. [2019-09-08 03:35:08,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:35:08,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2019-09-08 03:35:08,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:08,157 INFO L225 Difference]: With dead ends: 1427 [2019-09-08 03:35:08,157 INFO L226 Difference]: Without dead ends: 753 [2019-09-08 03:35:08,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:35:08,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 753 states. [2019-09-08 03:35:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 753 to 748. [2019-09-08 03:35:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-09-08 03:35:08,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1186 transitions. [2019-09-08 03:35:08,212 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1186 transitions. Word has length 115 [2019-09-08 03:35:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:08,214 INFO L475 AbstractCegarLoop]: Abstraction has 748 states and 1186 transitions. [2019-09-08 03:35:08,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:35:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1186 transitions. [2019-09-08 03:35:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 03:35:08,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:08,221 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:08,222 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:08,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:08,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1752638134, now seen corresponding path program 1 times [2019-09-08 03:35:08,222 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:08,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:08,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:08,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:08,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-08 03:35:08,407 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:08,407 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:08,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:09,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 2889 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:35:09,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 03:35:09,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:09,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:35:09,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:35:09,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:35:09,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:35:09,071 INFO L87 Difference]: Start difference. First operand 748 states and 1186 transitions. Second operand 6 states. [2019-09-08 03:35:09,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:09,204 INFO L93 Difference]: Finished difference Result 1475 states and 2353 transitions. [2019-09-08 03:35:09,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:35:09,205 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-08 03:35:09,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:09,212 INFO L225 Difference]: With dead ends: 1475 [2019-09-08 03:35:09,212 INFO L226 Difference]: Without dead ends: 749 [2019-09-08 03:35:09,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:35:09,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2019-09-08 03:35:09,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 749. [2019-09-08 03:35:09,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-09-08 03:35:09,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1182 transitions. [2019-09-08 03:35:09,252 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1182 transitions. Word has length 118 [2019-09-08 03:35:09,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:09,252 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1182 transitions. [2019-09-08 03:35:09,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:35:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1182 transitions. [2019-09-08 03:35:09,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 03:35:09,256 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:09,256 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:09,256 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:09,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:09,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1439677226, now seen corresponding path program 1 times [2019-09-08 03:35:09,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:09,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:09,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:09,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:35:09,445 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:09,445 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:35:09,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:09,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:09,874 INFO L256 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:35:09,883 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:09,984 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 03:35:09,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:09,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 03:35:09,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:35:09,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:35:09,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:35:09,993 INFO L87 Difference]: Start difference. First operand 749 states and 1182 transitions. Second operand 12 states. [2019-09-08 03:35:10,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:10,285 INFO L93 Difference]: Finished difference Result 1474 states and 2342 transitions. [2019-09-08 03:35:10,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:35:10,286 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2019-09-08 03:35:10,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:10,292 INFO L225 Difference]: With dead ends: 1474 [2019-09-08 03:35:10,292 INFO L226 Difference]: Without dead ends: 758 [2019-09-08 03:35:10,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 117 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-09-08 03:35:10,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-09-08 03:35:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 749. [2019-09-08 03:35:10,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-09-08 03:35:10,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1182 transitions. [2019-09-08 03:35:10,325 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1182 transitions. Word has length 119 [2019-09-08 03:35:10,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:10,325 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1182 transitions. [2019-09-08 03:35:10,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:35:10,326 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1182 transitions. [2019-09-08 03:35:10,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 03:35:10,328 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:10,329 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:10,329 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:10,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:10,329 INFO L82 PathProgramCache]: Analyzing trace with hash -488661128, now seen corresponding path program 1 times [2019-09-08 03:35:10,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:10,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:10,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:10,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:10,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:35:10,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:10,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:35:10,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:10,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:10,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 2891 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:35:10,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:11,018 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 03:35:11,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:11,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-09-08 03:35:11,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:35:11,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:35:11,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:35:11,026 INFO L87 Difference]: Start difference. First operand 749 states and 1182 transitions. Second operand 12 states. [2019-09-08 03:35:11,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:11,202 INFO L93 Difference]: Finished difference Result 1474 states and 2342 transitions. [2019-09-08 03:35:11,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:35:11,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-09-08 03:35:11,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:11,208 INFO L225 Difference]: With dead ends: 1474 [2019-09-08 03:35:11,208 INFO L226 Difference]: Without dead ends: 758 [2019-09-08 03:35:11,213 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 118 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-09-08 03:35:11,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-09-08 03:35:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 749. [2019-09-08 03:35:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 749 states. [2019-09-08 03:35:11,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1182 transitions. [2019-09-08 03:35:11,241 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1182 transitions. Word has length 120 [2019-09-08 03:35:11,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:11,241 INFO L475 AbstractCegarLoop]: Abstraction has 749 states and 1182 transitions. [2019-09-08 03:35:11,241 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:35:11,241 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1182 transitions. [2019-09-08 03:35:11,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 03:35:11,244 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:11,244 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:11,244 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:11,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:11,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1157992522, now seen corresponding path program 1 times [2019-09-08 03:35:11,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:11,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:11,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:11,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:11,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:35:11,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:11,432 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:11,448 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:11,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:11,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 2887 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:35:11,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 03:35:12,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:12,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:35:12,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:35:12,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:35:12,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:35:12,051 INFO L87 Difference]: Start difference. First operand 749 states and 1182 transitions. Second operand 14 states. [2019-09-08 03:35:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:12,420 INFO L93 Difference]: Finished difference Result 1487 states and 2366 transitions. [2019-09-08 03:35:12,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:35:12,421 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 120 [2019-09-08 03:35:12,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:12,430 INFO L225 Difference]: With dead ends: 1487 [2019-09-08 03:35:12,431 INFO L226 Difference]: Without dead ends: 771 [2019-09-08 03:35:12,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 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-09-08 03:35:12,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2019-09-08 03:35:12,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 759. [2019-09-08 03:35:12,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2019-09-08 03:35:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 1201 transitions. [2019-09-08 03:35:12,471 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 1201 transitions. Word has length 120 [2019-09-08 03:35:12,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:12,473 INFO L475 AbstractCegarLoop]: Abstraction has 759 states and 1201 transitions. [2019-09-08 03:35:12,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:35:12,473 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 1201 transitions. [2019-09-08 03:35:12,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 03:35:12,476 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:12,476 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:12,476 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:12,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:12,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1196367312, now seen corresponding path program 1 times [2019-09-08 03:35:12,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:12,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:12,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:12,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:12,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:12,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:12,673 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:35:12,674 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:12,674 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:12,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:13,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:13,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:35:13,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:13,414 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:35:13,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:13,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 03:35:13,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:35:13,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:35:13,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:35:13,423 INFO L87 Difference]: Start difference. First operand 759 states and 1201 transitions. Second operand 8 states. [2019-09-08 03:35:13,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:13,564 INFO L93 Difference]: Finished difference Result 1503 states and 2407 transitions. [2019-09-08 03:35:13,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:35:13,565 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-09-08 03:35:13,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:13,572 INFO L225 Difference]: With dead ends: 1503 [2019-09-08 03:35:13,572 INFO L226 Difference]: Without dead ends: 775 [2019-09-08 03:35:13,577 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 121 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-09-08 03:35:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-09-08 03:35:13,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 767. [2019-09-08 03:35:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-09-08 03:35:13,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1215 transitions. [2019-09-08 03:35:13,612 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1215 transitions. Word has length 122 [2019-09-08 03:35:13,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:13,613 INFO L475 AbstractCegarLoop]: Abstraction has 767 states and 1215 transitions. [2019-09-08 03:35:13,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:35:13,613 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1215 transitions. [2019-09-08 03:35:13,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 03:35:13,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:13,619 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:13,619 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:13,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:13,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1022229623, now seen corresponding path program 1 times [2019-09-08 03:35:13,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:13,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:13,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:13,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:13,742 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:35:13,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:13,742 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:13,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:14,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 2894 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:35:14,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:14,443 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:35:14,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:14,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 03:35:14,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:35:14,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:35:14,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:35:14,462 INFO L87 Difference]: Start difference. First operand 767 states and 1215 transitions. Second operand 8 states. [2019-09-08 03:35:14,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:14,606 INFO L93 Difference]: Finished difference Result 1515 states and 2428 transitions. [2019-09-08 03:35:14,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:35:14,607 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 123 [2019-09-08 03:35:14,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:14,613 INFO L225 Difference]: With dead ends: 1515 [2019-09-08 03:35:14,614 INFO L226 Difference]: Without dead ends: 779 [2019-09-08 03:35:14,618 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 123 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-09-08 03:35:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-09-08 03:35:14,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 771. [2019-09-08 03:35:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2019-09-08 03:35:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 1223 transitions. [2019-09-08 03:35:14,655 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 1223 transitions. Word has length 123 [2019-09-08 03:35:14,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:14,655 INFO L475 AbstractCegarLoop]: Abstraction has 771 states and 1223 transitions. [2019-09-08 03:35:14,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:35:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 1223 transitions. [2019-09-08 03:35:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 03:35:14,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:14,658 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:14,659 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:14,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 519527925, now seen corresponding path program 1 times [2019-09-08 03:35:14,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:14,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:14,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:14,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:14,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:14,856 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:35:14,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:14,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:35:14,860 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:35:14,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:35:14,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:35:14,861 INFO L87 Difference]: Start difference. First operand 771 states and 1223 transitions. Second operand 9 states. [2019-09-08 03:35:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:15,231 INFO L93 Difference]: Finished difference Result 1457 states and 2311 transitions. [2019-09-08 03:35:15,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:35:15,232 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 124 [2019-09-08 03:35:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:15,240 INFO L225 Difference]: With dead ends: 1457 [2019-09-08 03:35:15,240 INFO L226 Difference]: Without dead ends: 781 [2019-09-08 03:35:15,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:35:15,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 781 states. [2019-09-08 03:35:15,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 781 to 777. [2019-09-08 03:35:15,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-09-08 03:35:15,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1230 transitions. [2019-09-08 03:35:15,289 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1230 transitions. Word has length 124 [2019-09-08 03:35:15,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:15,289 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1230 transitions. [2019-09-08 03:35:15,289 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:35:15,290 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1230 transitions. [2019-09-08 03:35:15,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 03:35:15,292 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:15,292 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:15,292 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:15,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:15,293 INFO L82 PathProgramCache]: Analyzing trace with hash 71775017, now seen corresponding path program 1 times [2019-09-08 03:35:15,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:15,293 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:15,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:15,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:15,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:15,473 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:35:15,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:15,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:35:15,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:35:15,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:35:15,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:35:15,476 INFO L87 Difference]: Start difference. First operand 777 states and 1230 transitions. Second operand 9 states. [2019-09-08 03:35:15,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:15,717 INFO L93 Difference]: Finished difference Result 1459 states and 2312 transitions. [2019-09-08 03:35:15,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:35:15,717 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2019-09-08 03:35:15,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:15,723 INFO L225 Difference]: With dead ends: 1459 [2019-09-08 03:35:15,724 INFO L226 Difference]: Without dead ends: 783 [2019-09-08 03:35:15,728 INFO L628 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-09-08 03:35:15,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2019-09-08 03:35:15,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 777. [2019-09-08 03:35:15,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-09-08 03:35:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1230 transitions. [2019-09-08 03:35:15,761 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1230 transitions. Word has length 125 [2019-09-08 03:35:15,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:15,763 INFO L475 AbstractCegarLoop]: Abstraction has 777 states and 1230 transitions. [2019-09-08 03:35:15,763 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:35:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1230 transitions. [2019-09-08 03:35:15,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 03:35:15,766 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:15,766 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:15,766 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:15,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash -474236899, now seen corresponding path program 1 times [2019-09-08 03:35:15,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:15,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:15,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:15,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:15,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:15,882 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:35:15,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:15,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:35:15,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:35:15,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:35:15,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:35:15,884 INFO L87 Difference]: Start difference. First operand 777 states and 1230 transitions. Second operand 4 states. [2019-09-08 03:35:15,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:15,953 INFO L93 Difference]: Finished difference Result 1501 states and 2397 transitions. [2019-09-08 03:35:15,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:35:15,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2019-09-08 03:35:15,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:15,959 INFO L225 Difference]: With dead ends: 1501 [2019-09-08 03:35:15,959 INFO L226 Difference]: Without dead ends: 754 [2019-09-08 03:35:15,963 INFO L628 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-09-08 03:35:15,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2019-09-08 03:35:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2019-09-08 03:35:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-09-08 03:35:15,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1182 transitions. [2019-09-08 03:35:15,991 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1182 transitions. Word has length 125 [2019-09-08 03:35:15,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:15,991 INFO L475 AbstractCegarLoop]: Abstraction has 754 states and 1182 transitions. [2019-09-08 03:35:15,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:35:15,991 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1182 transitions. [2019-09-08 03:35:15,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 03:35:15,994 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:15,994 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:15,994 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:15,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:15,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1706474287, now seen corresponding path program 1 times [2019-09-08 03:35:15,995 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:15,995 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:15,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:15,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:16,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-09-08 03:35:16,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:16,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:35:16,123 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:35:16,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:35:16,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:35:16,124 INFO L87 Difference]: Start difference. First operand 754 states and 1182 transitions. Second operand 6 states. [2019-09-08 03:35:16,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:16,397 INFO L93 Difference]: Finished difference Result 1501 states and 2384 transitions. [2019-09-08 03:35:16,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:35:16,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 126 [2019-09-08 03:35:16,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:16,403 INFO L225 Difference]: With dead ends: 1501 [2019-09-08 03:35:16,404 INFO L226 Difference]: Without dead ends: 764 [2019-09-08 03:35:16,408 INFO L628 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-09-08 03:35:16,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2019-09-08 03:35:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 761. [2019-09-08 03:35:16,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 761 states. [2019-09-08 03:35:16,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 761 states and 1181 transitions. [2019-09-08 03:35:16,436 INFO L78 Accepts]: Start accepts. Automaton has 761 states and 1181 transitions. Word has length 126 [2019-09-08 03:35:16,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:16,438 INFO L475 AbstractCegarLoop]: Abstraction has 761 states and 1181 transitions. [2019-09-08 03:35:16,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:35:16,438 INFO L276 IsEmpty]: Start isEmpty. Operand 761 states and 1181 transitions. [2019-09-08 03:35:16,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 03:35:16,440 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:16,441 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:16,441 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:16,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:16,441 INFO L82 PathProgramCache]: Analyzing trace with hash -200315121, now seen corresponding path program 1 times [2019-09-08 03:35:16,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:16,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:16,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:16,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:16,600 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:35:16,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:16,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:35:16,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:35:16,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:35:16,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:35:16,602 INFO L87 Difference]: Start difference. First operand 761 states and 1181 transitions. Second operand 7 states. [2019-09-08 03:35:16,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:16,732 INFO L93 Difference]: Finished difference Result 1441 states and 2255 transitions. [2019-09-08 03:35:16,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:35:16,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 126 [2019-09-08 03:35:16,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:16,739 INFO L225 Difference]: With dead ends: 1441 [2019-09-08 03:35:16,740 INFO L226 Difference]: Without dead ends: 747 [2019-09-08 03:35:16,744 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:35:16,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-09-08 03:35:16,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 745. [2019-09-08 03:35:16,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2019-09-08 03:35:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 1148 transitions. [2019-09-08 03:35:16,812 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 1148 transitions. Word has length 126 [2019-09-08 03:35:16,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:16,812 INFO L475 AbstractCegarLoop]: Abstraction has 745 states and 1148 transitions. [2019-09-08 03:35:16,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:35:16,813 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 1148 transitions. [2019-09-08 03:35:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 03:35:16,818 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:16,818 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:16,818 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:16,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:16,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1148731581, now seen corresponding path program 1 times [2019-09-08 03:35:16,819 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:16,819 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:16,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:16,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:16,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-08 03:35:17,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:17,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:35:17,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:35:17,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:35:17,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:35:17,004 INFO L87 Difference]: Start difference. First operand 745 states and 1148 transitions. Second operand 11 states. [2019-09-08 03:35:17,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:17,343 INFO L93 Difference]: Finished difference Result 1419 states and 2217 transitions. [2019-09-08 03:35:17,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:35:17,345 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 127 [2019-09-08 03:35:17,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:17,357 INFO L225 Difference]: With dead ends: 1419 [2019-09-08 03:35:17,357 INFO L226 Difference]: Without dead ends: 741 [2019-09-08 03:35:17,363 INFO L628 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-09-08 03:35:17,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2019-09-08 03:35:17,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2019-09-08 03:35:17,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 739 states. [2019-09-08 03:35:17,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 1138 transitions. [2019-09-08 03:35:17,395 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 1138 transitions. Word has length 127 [2019-09-08 03:35:17,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:17,396 INFO L475 AbstractCegarLoop]: Abstraction has 739 states and 1138 transitions. [2019-09-08 03:35:17,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:35:17,396 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 1138 transitions. [2019-09-08 03:35:17,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 03:35:17,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:17,400 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:17,400 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:17,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:17,400 INFO L82 PathProgramCache]: Analyzing trace with hash -713691512, now seen corresponding path program 1 times [2019-09-08 03:35:17,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:17,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:17,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:17,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:17,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:17,561 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-08 03:35:17,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:17,561 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:35:17,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:18,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:18,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 2900 conjuncts, 13 conjunts are in the unsatisfiable core [2019-09-08 03:35:18,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:18,071 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (10)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:35:18,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:18,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-09-08 03:35:18,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:35:18,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:35:18,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:35:18,084 INFO L87 Difference]: Start difference. First operand 739 states and 1138 transitions. Second operand 5 states. [2019-09-08 03:35:18,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:18,487 INFO L93 Difference]: Finished difference Result 2065 states and 3269 transitions. [2019-09-08 03:35:18,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:35:18,488 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-08 03:35:18,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:18,503 INFO L225 Difference]: With dead ends: 2065 [2019-09-08 03:35:18,504 INFO L226 Difference]: Without dead ends: 1399 [2019-09-08 03:35:18,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:35:18,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-09-08 03:35:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 1326. [2019-09-08 03:35:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1326 states. [2019-09-08 03:35:18,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 2077 transitions. [2019-09-08 03:35:18,603 INFO L78 Accepts]: Start accepts. Automaton has 1326 states and 2077 transitions. Word has length 129 [2019-09-08 03:35:18,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:18,604 INFO L475 AbstractCegarLoop]: Abstraction has 1326 states and 2077 transitions. [2019-09-08 03:35:18,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:35:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1326 states and 2077 transitions. [2019-09-08 03:35:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 03:35:18,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:18,612 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:18,612 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:18,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:18,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1018900320, now seen corresponding path program 1 times [2019-09-08 03:35:18,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:18,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:18,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:18,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:18,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:19,027 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-09-08 03:35:19,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:19,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:35:19,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:35:19,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:35:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:35:19,032 INFO L87 Difference]: Start difference. First operand 1326 states and 2077 transitions. Second operand 10 states. [2019-09-08 03:35:20,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:20,589 INFO L93 Difference]: Finished difference Result 3132 states and 4924 transitions. [2019-09-08 03:35:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:35:20,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 189 [2019-09-08 03:35:20,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:20,601 INFO L225 Difference]: With dead ends: 3132 [2019-09-08 03:35:20,602 INFO L226 Difference]: Without dead ends: 1879 [2019-09-08 03:35:20,609 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-08 03:35:20,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2019-09-08 03:35:20,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1875. [2019-09-08 03:35:20,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1875 states. [2019-09-08 03:35:20,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 2907 transitions. [2019-09-08 03:35:20,686 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 2907 transitions. Word has length 189 [2019-09-08 03:35:20,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:20,687 INFO L475 AbstractCegarLoop]: Abstraction has 1875 states and 2907 transitions. [2019-09-08 03:35:20,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:35:20,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 2907 transitions. [2019-09-08 03:35:20,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 03:35:20,693 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:20,693 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:20,694 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:20,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:20,694 INFO L82 PathProgramCache]: Analyzing trace with hash -106450315, now seen corresponding path program 1 times [2019-09-08 03:35:20,694 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:20,694 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:20,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:20,695 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:20,695 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:20,918 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 03:35:20,919 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:20,920 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:20,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:21,448 INFO L256 TraceCheckSpWp]: Trace formula consists of 3280 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:35:21,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:21,568 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:35:21,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:21,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:35:21,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:35:21,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:35:21,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:35:21,618 INFO L87 Difference]: Start difference. First operand 1875 states and 2907 transitions. Second operand 14 states. [2019-09-08 03:35:35,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:35,347 INFO L93 Difference]: Finished difference Result 5443 states and 8790 transitions. [2019-09-08 03:35:35,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:35:35,348 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 190 [2019-09-08 03:35:35,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:35,376 INFO L225 Difference]: With dead ends: 5443 [2019-09-08 03:35:35,377 INFO L226 Difference]: Without dead ends: 3641 [2019-09-08 03:35:35,390 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 212 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:35:35,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3641 states. [2019-09-08 03:35:35,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3641 to 3583. [2019-09-08 03:35:35,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3583 states. [2019-09-08 03:35:35,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 5613 transitions. [2019-09-08 03:35:35,620 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 5613 transitions. Word has length 190 [2019-09-08 03:35:35,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:35,621 INFO L475 AbstractCegarLoop]: Abstraction has 3583 states and 5613 transitions. [2019-09-08 03:35:35,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:35:35,621 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 5613 transitions. [2019-09-08 03:35:35,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 03:35:35,633 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:35,633 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:35,634 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:35,635 INFO L82 PathProgramCache]: Analyzing trace with hash -209204489, now seen corresponding path program 1 times [2019-09-08 03:35:35,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:35,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:35,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:35,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:35,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:35,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:35:35,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:35,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:35:35,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:36,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:36,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 3282 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:35:36,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:36,566 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:35:36,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:36,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:35:36,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:35:36,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:35:36,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:35:36,592 INFO L87 Difference]: Start difference. First operand 3583 states and 5613 transitions. Second operand 14 states. [2019-09-08 03:35:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:50,391 INFO L93 Difference]: Finished difference Result 9023 states and 14566 transitions. [2019-09-08 03:35:50,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 03:35:50,397 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 192 [2019-09-08 03:35:50,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:50,432 INFO L225 Difference]: With dead ends: 9023 [2019-09-08 03:35:50,432 INFO L226 Difference]: Without dead ends: 5513 [2019-09-08 03:35:50,453 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 214 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-09-08 03:35:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2019-09-08 03:35:50,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5399. [2019-09-08 03:35:50,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5399 states. [2019-09-08 03:35:50,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5399 states to 5399 states and 8489 transitions. [2019-09-08 03:35:50,704 INFO L78 Accepts]: Start accepts. Automaton has 5399 states and 8489 transitions. Word has length 192 [2019-09-08 03:35:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:50,706 INFO L475 AbstractCegarLoop]: Abstraction has 5399 states and 8489 transitions. [2019-09-08 03:35:50,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:35:50,706 INFO L276 IsEmpty]: Start isEmpty. Operand 5399 states and 8489 transitions. [2019-09-08 03:35:50,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-09-08 03:35:50,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:50,714 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:50,715 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash -204414283, now seen corresponding path program 1 times [2019-09-08 03:35:50,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:50,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:50,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:50,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:50,917 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:35:50,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:50,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:35:50,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:35:50,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:35:50,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:35:50,920 INFO L87 Difference]: Start difference. First operand 5399 states and 8489 transitions. Second operand 6 states. [2019-09-08 03:35:51,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:51,738 INFO L93 Difference]: Finished difference Result 10845 states and 17466 transitions. [2019-09-08 03:35:51,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:35:51,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-09-08 03:35:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:51,776 INFO L225 Difference]: With dead ends: 10845 [2019-09-08 03:35:51,776 INFO L226 Difference]: Without dead ends: 5471 [2019-09-08 03:35:51,801 INFO L628 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-09-08 03:35:51,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5471 states. [2019-09-08 03:35:52,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5471 to 5471. [2019-09-08 03:35:52,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2019-09-08 03:35:52,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 8513 transitions. [2019-09-08 03:35:52,027 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 8513 transitions. Word has length 194 [2019-09-08 03:35:52,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:52,028 INFO L475 AbstractCegarLoop]: Abstraction has 5471 states and 8513 transitions. [2019-09-08 03:35:52,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:35:52,028 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 8513 transitions. [2019-09-08 03:35:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-09-08 03:35:52,035 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:52,035 INFO L399 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] [2019-09-08 03:35:52,035 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:52,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:52,035 INFO L82 PathProgramCache]: Analyzing trace with hash 474048047, now seen corresponding path program 1 times [2019-09-08 03:35:52,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:52,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:52,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:52,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:52,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:52,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-09-08 03:35:52,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:35:52,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:35:52,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:35:52,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:35:52,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:35:52,212 INFO L87 Difference]: Start difference. First operand 5471 states and 8513 transitions. Second operand 6 states. [2019-09-08 03:35:53,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:35:53,101 INFO L93 Difference]: Finished difference Result 11001 states and 17514 transitions. [2019-09-08 03:35:53,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:35:53,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 196 [2019-09-08 03:35:53,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:35:53,132 INFO L225 Difference]: With dead ends: 11001 [2019-09-08 03:35:53,132 INFO L226 Difference]: Without dead ends: 5555 [2019-09-08 03:35:53,151 INFO L628 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-09-08 03:35:53,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2019-09-08 03:35:53,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 5555. [2019-09-08 03:35:53,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5555 states. [2019-09-08 03:35:53,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5555 states to 5555 states and 8549 transitions. [2019-09-08 03:35:53,382 INFO L78 Accepts]: Start accepts. Automaton has 5555 states and 8549 transitions. Word has length 196 [2019-09-08 03:35:53,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:35:53,382 INFO L475 AbstractCegarLoop]: Abstraction has 5555 states and 8549 transitions. [2019-09-08 03:35:53,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:35:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 5555 states and 8549 transitions. [2019-09-08 03:35:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 03:35:53,389 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:35:53,389 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:35:53,389 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:35:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:35:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1436115189, now seen corresponding path program 1 times [2019-09-08 03:35:53,390 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:35:53,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:35:53,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:53,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:35:53,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:35:53,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:35:53,600 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:35:53,600 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:35:53,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:35:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:35:54,101 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:35:54,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:35:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-08 03:35:54,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:35:54,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2019-09-08 03:35:54,214 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:35:54,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:35:54,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:35:54,215 INFO L87 Difference]: Start difference. First operand 5555 states and 8549 transitions. Second operand 14 states. [2019-09-08 03:36:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:36:23,301 INFO L93 Difference]: Finished difference Result 39336 states and 63835 transitions. [2019-09-08 03:36:23,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2019-09-08 03:36:23,302 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 198 [2019-09-08 03:36:23,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:36:23,509 INFO L225 Difference]: With dead ends: 39336 [2019-09-08 03:36:23,509 INFO L226 Difference]: Without dead ends: 33854 [2019-09-08 03:36:23,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 235 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1130 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=514, Invalid=3268, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 03:36:23,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33854 states. [2019-09-08 03:36:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33854 to 32660. [2019-09-08 03:36:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32660 states. [2019-09-08 03:36:26,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32660 states to 32660 states and 51374 transitions. [2019-09-08 03:36:26,028 INFO L78 Accepts]: Start accepts. Automaton has 32660 states and 51374 transitions. Word has length 198 [2019-09-08 03:36:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:36:26,029 INFO L475 AbstractCegarLoop]: Abstraction has 32660 states and 51374 transitions. [2019-09-08 03:36:26,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:36:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 32660 states and 51374 transitions. [2019-09-08 03:36:26,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 03:36:26,043 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:36:26,044 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:36:26,044 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:36:26,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:36:26,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1903529150, now seen corresponding path program 1 times [2019-09-08 03:36:26,044 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:36:26,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:36:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:26,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:36:26,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:36:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:36:26,182 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:36:26,183 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:36:26,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:36:26,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:36:26,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:36:26,694 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:36:26,744 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:36:26,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:36:26,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-09-08 03:36:26,753 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:36:26,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:36:26,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:36:26,753 INFO L87 Difference]: Start difference. First operand 32660 states and 51374 transitions. Second operand 10 states. [2019-09-08 03:36:28,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:36:28,772 INFO L93 Difference]: Finished difference Result 86363 states and 137391 transitions. [2019-09-08 03:36:28,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 03:36:28,774 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 199 [2019-09-08 03:36:28,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:36:30,829 INFO L225 Difference]: With dead ends: 86363 [2019-09-08 03:36:30,829 INFO L226 Difference]: Without dead ends: 53720 [2019-09-08 03:36:30,972 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2019-09-08 03:36:31,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53720 states. [2019-09-08 03:36:33,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53720 to 53320. [2019-09-08 03:36:33,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53320 states. [2019-09-08 03:36:33,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53320 states to 53320 states and 83800 transitions. [2019-09-08 03:36:33,349 INFO L78 Accepts]: Start accepts. Automaton has 53320 states and 83800 transitions. Word has length 199 [2019-09-08 03:36:33,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:36:33,350 INFO L475 AbstractCegarLoop]: Abstraction has 53320 states and 83800 transitions. [2019-09-08 03:36:33,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:36:33,350 INFO L276 IsEmpty]: Start isEmpty. Operand 53320 states and 83800 transitions. [2019-09-08 03:36:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-09-08 03:36:33,372 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:36:33,372 INFO L399 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] [2019-09-08 03:36:33,372 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:36:33,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:36:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1256204560, now seen corresponding path program 1 times [2019-09-08 03:36:33,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:36:33,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:36:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:33,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:36:33,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:33,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:36:33,510 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:36:33,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:36:33,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:36:33,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:36:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:36:33,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:36:33,512 INFO L87 Difference]: Start difference. First operand 53320 states and 83800 transitions. Second operand 9 states. [2019-09-08 03:36:35,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:36:35,216 INFO L93 Difference]: Finished difference Result 87199 states and 136530 transitions. [2019-09-08 03:36:35,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:36:35,222 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 200 [2019-09-08 03:36:35,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:36:35,409 INFO L225 Difference]: With dead ends: 87199 [2019-09-08 03:36:35,409 INFO L226 Difference]: Without dead ends: 33946 [2019-09-08 03:36:35,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:36:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33946 states. [2019-09-08 03:36:36,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33946 to 33910. [2019-09-08 03:36:36,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33910 states. [2019-09-08 03:36:36,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33910 states to 33910 states and 52732 transitions. [2019-09-08 03:36:36,724 INFO L78 Accepts]: Start accepts. Automaton has 33910 states and 52732 transitions. Word has length 200 [2019-09-08 03:36:36,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:36:36,726 INFO L475 AbstractCegarLoop]: Abstraction has 33910 states and 52732 transitions. [2019-09-08 03:36:36,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:36:36,726 INFO L276 IsEmpty]: Start isEmpty. Operand 33910 states and 52732 transitions. [2019-09-08 03:36:36,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-09-08 03:36:36,734 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:36:36,734 INFO L399 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:36:36,735 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:36:36,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:36:36,735 INFO L82 PathProgramCache]: Analyzing trace with hash 915668462, now seen corresponding path program 1 times [2019-09-08 03:36:36,735 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:36:36,735 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:36:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:36,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:36:36,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:36,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:36:36,974 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:36:36,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:36:36,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:36:36,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:36:36,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:36:36,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:36:36,976 INFO L87 Difference]: Start difference. First operand 33910 states and 52732 transitions. Second operand 11 states. [2019-09-08 03:36:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:36:48,355 INFO L93 Difference]: Finished difference Result 64278 states and 101185 transitions. [2019-09-08 03:36:48,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 03:36:48,355 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 209 [2019-09-08 03:36:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:36:48,486 INFO L225 Difference]: With dead ends: 64278 [2019-09-08 03:36:48,486 INFO L226 Difference]: Without dead ends: 34334 [2019-09-08 03:36:48,555 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=455, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:36:48,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34334 states. [2019-09-08 03:36:51,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34334 to 33878. [2019-09-08 03:36:51,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33878 states. [2019-09-08 03:36:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33878 states to 33878 states and 52660 transitions. [2019-09-08 03:36:51,372 INFO L78 Accepts]: Start accepts. Automaton has 33878 states and 52660 transitions. Word has length 209 [2019-09-08 03:36:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:36:51,373 INFO L475 AbstractCegarLoop]: Abstraction has 33878 states and 52660 transitions. [2019-09-08 03:36:51,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:36:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 33878 states and 52660 transitions. [2019-09-08 03:36:51,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 03:36:51,381 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:36:51,381 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:36:51,382 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:36:51,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:36:51,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1926157623, now seen corresponding path program 1 times [2019-09-08 03:36:51,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:36:51,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:36:51,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:51,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:36:51,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:36:51,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:36:51,520 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:36:51,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:36:51,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:36:51,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:36:51,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:36:51,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:36:51,522 INFO L87 Difference]: Start difference. First operand 33878 states and 52660 transitions. Second operand 6 states. [2019-09-08 03:36:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:36:58,261 INFO L93 Difference]: Finished difference Result 91107 states and 150461 transitions. [2019-09-08 03:36:58,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:36:58,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2019-09-08 03:36:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:36:58,548 INFO L225 Difference]: With dead ends: 91107 [2019-09-08 03:36:58,548 INFO L226 Difference]: Without dead ends: 57302 [2019-09-08 03:36:58,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:36:58,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57302 states. [2019-09-08 03:37:00,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57302 to 53615. [2019-09-08 03:37:00,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53615 states. [2019-09-08 03:37:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53615 states to 53615 states and 84149 transitions. [2019-09-08 03:37:00,705 INFO L78 Accepts]: Start accepts. Automaton has 53615 states and 84149 transitions. Word has length 223 [2019-09-08 03:37:00,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:00,705 INFO L475 AbstractCegarLoop]: Abstraction has 53615 states and 84149 transitions. [2019-09-08 03:37:00,705 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:37:00,705 INFO L276 IsEmpty]: Start isEmpty. Operand 53615 states and 84149 transitions. [2019-09-08 03:37:00,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-09-08 03:37:00,713 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:00,713 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:37:00,713 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:00,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:00,714 INFO L82 PathProgramCache]: Analyzing trace with hash 947713581, now seen corresponding path program 1 times [2019-09-08 03:37:00,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:00,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:00,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:00,715 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:00,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:37:00,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:00,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:37:00,863 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:37:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:37:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:37:00,864 INFO L87 Difference]: Start difference. First operand 53615 states and 84149 transitions. Second operand 6 states. [2019-09-08 03:37:10,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:10,818 INFO L93 Difference]: Finished difference Result 160846 states and 275283 transitions. [2019-09-08 03:37:10,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:37:10,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-09-08 03:37:10,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:11,238 INFO L225 Difference]: With dead ends: 160846 [2019-09-08 03:37:11,238 INFO L226 Difference]: Without dead ends: 107304 [2019-09-08 03:37:11,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:37:11,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107304 states. [2019-09-08 03:37:18,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107304 to 98101. [2019-09-08 03:37:18,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98101 states. [2019-09-08 03:37:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98101 states to 98101 states and 157258 transitions. [2019-09-08 03:37:19,141 INFO L78 Accepts]: Start accepts. Automaton has 98101 states and 157258 transitions. Word has length 224 [2019-09-08 03:37:19,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:37:19,141 INFO L475 AbstractCegarLoop]: Abstraction has 98101 states and 157258 transitions. [2019-09-08 03:37:19,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:37:19,142 INFO L276 IsEmpty]: Start isEmpty. Operand 98101 states and 157258 transitions. [2019-09-08 03:37:19,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-09-08 03:37:19,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:37:19,150 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:37:19,151 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:37:19,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:37:19,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1084367219, now seen corresponding path program 1 times [2019-09-08 03:37:19,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:37:19,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:37:19,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:19,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:37:19,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:37:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:37:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:37:19,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:37:19,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:37:19,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:37:19,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:37:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:37:19,299 INFO L87 Difference]: Start difference. First operand 98101 states and 157258 transitions. Second operand 6 states. [2019-09-08 03:37:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:37:36,910 INFO L93 Difference]: Finished difference Result 324745 states and 588015 transitions. [2019-09-08 03:37:36,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:37:36,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-09-08 03:37:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:37:38,154 INFO L225 Difference]: With dead ends: 324745 [2019-09-08 03:37:38,154 INFO L226 Difference]: Without dead ends: 226717 [2019-09-08 03:37:38,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:37:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226717 states. [2019-09-08 03:37:58,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226717 to 202417. [2019-09-08 03:37:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202417 states. [2019-09-08 03:38:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202417 states to 202417 states and 336073 transitions. [2019-09-08 03:38:00,127 INFO L78 Accepts]: Start accepts. Automaton has 202417 states and 336073 transitions. Word has length 225 [2019-09-08 03:38:00,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:38:00,128 INFO L475 AbstractCegarLoop]: Abstraction has 202417 states and 336073 transitions. [2019-09-08 03:38:00,128 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:38:00,128 INFO L276 IsEmpty]: Start isEmpty. Operand 202417 states and 336073 transitions. [2019-09-08 03:38:00,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-09-08 03:38:00,134 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:38:00,134 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:38:00,134 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:38:00,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:38:00,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1429310569, now seen corresponding path program 1 times [2019-09-08 03:38:00,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:38:00,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:38:00,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:00,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:38:00,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:38:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:38:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:38:00,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:38:00,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:38:00,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:38:00,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:38:00,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:38:00,281 INFO L87 Difference]: Start difference. First operand 202417 states and 336073 transitions. Second operand 6 states. [2019-09-08 03:38:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:38:51,696 INFO L93 Difference]: Finished difference Result 731072 states and 1432303 transitions. [2019-09-08 03:38:51,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:38:51,696 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2019-09-08 03:38:51,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:38:54,694 INFO L225 Difference]: With dead ends: 731072 [2019-09-08 03:38:54,694 INFO L226 Difference]: Without dead ends: 528728 [2019-09-08 03:38:57,322 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:38:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528728 states. [2019-09-08 03:39:49,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528728 to 461701. [2019-09-08 03:39:49,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461701 states. [2019-09-08 03:40:06,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461701 states to 461701 states and 806458 transitions. [2019-09-08 03:40:06,141 INFO L78 Accepts]: Start accepts. Automaton has 461701 states and 806458 transitions. Word has length 226 [2019-09-08 03:40:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:06,142 INFO L475 AbstractCegarLoop]: Abstraction has 461701 states and 806458 transitions. [2019-09-08 03:40:06,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:40:06,142 INFO L276 IsEmpty]: Start isEmpty. Operand 461701 states and 806458 transitions. [2019-09-08 03:40:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 03:40:06,151 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:06,151 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:06,151 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:06,152 INFO L82 PathProgramCache]: Analyzing trace with hash -358699601, now seen corresponding path program 1 times [2019-09-08 03:40:06,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:06,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:06,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:06,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-08 03:40:06,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:06,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:40:06,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:40:06,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:40:06,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:40:06,305 INFO L87 Difference]: Start difference. First operand 461701 states and 806458 transitions. Second operand 6 states.