java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec1_product22.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:04:15,312 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:04:15,314 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:04:15,326 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:04:15,326 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:04:15,327 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:04:15,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:04:15,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:04:15,331 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:04:15,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:04:15,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:04:15,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:04:15,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:04:15,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:04:15,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:04:15,337 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:04:15,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:04:15,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:04:15,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:04:15,343 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:04:15,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:04:15,346 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:04:15,347 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:04:15,347 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:04:15,350 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:04:15,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:04:15,350 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:04:15,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:04:15,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:04:15,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:04:15,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:04:15,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:04:15,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:04:15,355 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:04:15,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:04:15,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:04:15,357 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:04:15,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:04:15,358 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:04:15,359 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:04:15,359 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:04:15,360 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:04:15,375 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:04:15,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:04:15,376 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:04:15,376 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:04:15,376 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:04:15,377 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:04:15,377 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:04:15,377 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:04:15,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:04:15,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:04:15,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:04:15,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:04:15,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:04:15,378 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:04:15,378 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:04:15,379 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:04:15,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:04:15,379 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:04:15,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:04:15,379 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:04:15,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:04:15,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:04:15,380 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:04:15,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:04:15,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:04:15,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:04:15,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:04:15,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:04:15,381 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:04:15,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:04:15,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:04:15,423 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:04:15,425 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:04:15,425 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:04:15,426 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product22.cil.c [2019-10-02 12:04:15,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c71e11d/174435d2e7384f6aafefbecc8db059ba/FLAGfabfc0c87 [2019-10-02 12:04:16,053 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:04:16,058 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product22.cil.c [2019-10-02 12:04:16,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c71e11d/174435d2e7384f6aafefbecc8db059ba/FLAGfabfc0c87 [2019-10-02 12:04:16,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e2c71e11d/174435d2e7384f6aafefbecc8db059ba [2019-10-02 12:04:16,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:04:16,332 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:04:16,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:04:16,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:04:16,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:04:16,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:04:16" (1/1) ... [2019-10-02 12:04:16,340 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46a202d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:16, skipping insertion in model container [2019-10-02 12:04:16,340 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:04:16" (1/1) ... [2019-10-02 12:04:16,348 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:04:16,437 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:04:17,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:04:17,147 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:04:17,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:04:17,357 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:04:17,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17 WrapperNode [2019-10-02 12:04:17,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:04:17,358 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:04:17,359 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:04:17,359 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:04:17,372 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (1/1) ... [2019-10-02 12:04:17,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (1/1) ... [2019-10-02 12:04:17,406 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (1/1) ... [2019-10-02 12:04:17,407 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (1/1) ... [2019-10-02 12:04:17,473 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (1/1) ... [2019-10-02 12:04:17,520 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (1/1) ... [2019-10-02 12:04:17,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (1/1) ... [2019-10-02 12:04:17,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:04:17,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:04:17,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:04:17,562 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:04:17,563 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:04:17,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:04:17,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:04:17,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:04:17,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:04:17,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:04:17,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:04:17,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:04:17,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:04:17,637 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:04:17,637 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:04:17,638 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:04:17,638 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:04:17,638 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:04:17,639 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:04:17,639 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:04:17,639 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:04:17,639 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:04:17,639 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:04:17,640 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:04:17,640 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:04:17,640 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:04:17,640 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:04:17,641 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:04:17,641 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:04:17,641 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:04:17,641 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:04:17,641 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:04:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:04:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:04:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:04:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:04:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:04:17,642 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:04:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:04:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:04:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:04:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:04:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:04:17,643 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:04:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:04:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:04:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:04:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:04:17,644 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:04:17,645 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:04:17,645 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:04:17,645 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:04:17,645 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:04:17,646 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:04:17,646 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:04:17,646 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:04:17,646 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:04:17,646 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:04:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:04:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:04:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:04:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:04:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:04:17,647 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:04:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:04:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:04:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:04:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:04:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:04:17,648 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:04:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:04:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:04:17,649 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:04:17,650 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:04:17,650 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__twothirdsfull [2019-10-02 12:04:17,650 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:04:17,650 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__twothirdsfull [2019-10-02 12:04:17,650 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:04:17,651 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:04:17,651 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:04:17,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:04:17,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:04:17,652 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:04:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:04:17,652 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:04:17,653 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:04:17,653 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:04:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:04:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:04:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:04:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:04:17,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:04:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:04:17,656 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:04:17,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:04:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:04:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:04:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:04:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:04:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:04:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:04:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:04:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:04:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:04:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:04:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:04:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:04:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:04:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:04:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:04:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-10-02 12:04:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:04:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:04:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:04:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:04:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:04:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:04:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:04:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:04:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:04:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:04:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:04:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:04:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:04:17,661 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:04:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:04:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:04:17,662 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:04:17,663 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:04:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:04:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:04:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:04:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:04:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:04:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:04:17,664 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:04:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:04:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-10-02 12:04:17,665 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-10-02 12:04:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:04:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:04:17,668 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:04:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:04:17,669 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:04:17,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:04:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:04:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:04:17,673 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:04:17,674 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:04:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:04:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:04:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:04:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:04:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:04:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:04:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:04:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:04:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:04:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:04:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:04:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:04:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:04:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 12:04:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:04:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:04:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 12:04:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:04:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:04:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:04:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__twothirdsfull [2019-10-02 12:04:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-10-02 12:04:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__twothirdsfull [2019-10-02 12:04:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:04:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:04:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:04:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:04:19,923 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:04:19,924 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:04:19,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:04:19 BoogieIcfgContainer [2019-10-02 12:04:19,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:04:19,927 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:04:19,927 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:04:19,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:04:19,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:04:16" (1/3) ... [2019-10-02 12:04:19,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483ffe3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:04:19, skipping insertion in model container [2019-10-02 12:04:19,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:04:17" (2/3) ... [2019-10-02 12:04:19,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483ffe3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:04:19, skipping insertion in model container [2019-10-02 12:04:19,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:04:19" (3/3) ... [2019-10-02 12:04:19,934 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product22.cil.c [2019-10-02 12:04:19,944 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:04:19,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:04:19,972 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:04:20,015 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:04:20,016 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:04:20,016 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:04:20,016 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:04:20,016 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:04:20,016 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:04:20,016 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:04:20,017 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:04:20,017 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:04:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states. [2019-10-02 12:04:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-02 12:04:20,087 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:20,088 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:20,092 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:20,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:20,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1159872126, now seen corresponding path program 1 times [2019-10-02 12:04:20,100 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:20,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:20,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:20,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:20,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:20,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:20,807 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:04:20,810 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:20,810 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:20,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:21,413 INFO L256 TraceCheckSpWp]: Trace formula consists of 3170 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-02 12:04:21,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:21,499 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 12:04:21,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:21,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-02 12:04:21,514 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:04:21,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:04:21,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:04:21,530 INFO L87 Difference]: Start difference. First operand 790 states. Second operand 4 states. [2019-10-02 12:04:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:21,712 INFO L93 Difference]: Finished difference Result 1250 states and 2017 transitions. [2019-10-02 12:04:21,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:04:21,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-10-02 12:04:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:21,738 INFO L225 Difference]: With dead ends: 1250 [2019-10-02 12:04:21,738 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:04:21,749 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:04:21,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:04:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:04:21,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:04:21,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1002 transitions. [2019-10-02 12:04:21,870 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1002 transitions. Word has length 116 [2019-10-02 12:04:21,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:21,871 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1002 transitions. [2019-10-02 12:04:21,871 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:04:21,871 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1002 transitions. [2019-10-02 12:04:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-02 12:04:21,877 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:21,877 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:21,877 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:21,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:21,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1607555785, now seen corresponding path program 1 times [2019-10-02 12:04:21,878 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:21,878 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:21,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:21,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:22,094 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:04:22,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:22,095 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:22,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:22,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:22,695 INFO L256 TraceCheckSpWp]: Trace formula consists of 3175 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:22,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:22,761 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:04:22,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:22,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:22,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:22,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:22,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:22,782 INFO L87 Difference]: Start difference. First operand 629 states and 1002 transitions. Second operand 6 states. [2019-10-02 12:04:22,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:22,908 INFO L93 Difference]: Finished difference Result 1230 states and 1977 transitions. [2019-10-02 12:04:22,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:04:22,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-10-02 12:04:22,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:22,916 INFO L225 Difference]: With dead ends: 1230 [2019-10-02 12:04:22,918 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:04:22,926 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:22,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:04:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:04:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:04:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 1001 transitions. [2019-10-02 12:04:22,986 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 1001 transitions. Word has length 120 [2019-10-02 12:04:22,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:22,988 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 1001 transitions. [2019-10-02 12:04:22,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 1001 transitions. [2019-10-02 12:04:22,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 12:04:22,992 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:22,992 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:22,992 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:22,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:22,993 INFO L82 PathProgramCache]: Analyzing trace with hash -104433287, now seen corresponding path program 1 times [2019-10-02 12:04:22,993 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:22,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:22,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:22,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:22,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:23,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:23,132 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:04:23,133 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:23,133 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:23,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:23,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 3177 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:23,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:04:23,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:23,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:23,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:23,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:23,763 INFO L87 Difference]: Start difference. First operand 629 states and 1001 transitions. Second operand 6 states. [2019-10-02 12:04:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:23,863 INFO L93 Difference]: Finished difference Result 1234 states and 1980 transitions. [2019-10-02 12:04:23,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:04:23,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 122 [2019-10-02 12:04:23,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:23,868 INFO L225 Difference]: With dead ends: 1234 [2019-10-02 12:04:23,868 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:04:23,871 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:23,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:04:23,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-02 12:04:23,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 12:04:23,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1006 transitions. [2019-10-02 12:04:23,899 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1006 transitions. Word has length 122 [2019-10-02 12:04:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:23,899 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 1006 transitions. [2019-10-02 12:04:23,899 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:23,900 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1006 transitions. [2019-10-02 12:04:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-02 12:04:23,902 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:23,902 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:23,903 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:23,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash -730714916, now seen corresponding path program 1 times [2019-10-02 12:04:23,903 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:23,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:23,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:23,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:23,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:04:24,051 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:24,051 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:24,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:24,663 INFO L256 TraceCheckSpWp]: Trace formula consists of 3178 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:24,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:24,717 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:24,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:24,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:24,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:24,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:24,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:24,737 INFO L87 Difference]: Start difference. First operand 635 states and 1006 transitions. Second operand 6 states. [2019-10-02 12:04:24,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:24,851 INFO L93 Difference]: Finished difference Result 1233 states and 1971 transitions. [2019-10-02 12:04:24,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:24,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-02 12:04:24,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:24,861 INFO L225 Difference]: With dead ends: 1233 [2019-10-02 12:04:24,861 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:04:24,867 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:04:24,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-02 12:04:24,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 12:04:24,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1005 transitions. [2019-10-02 12:04:24,895 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1005 transitions. Word has length 123 [2019-10-02 12:04:24,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:24,896 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 1005 transitions. [2019-10-02 12:04:24,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:24,896 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1005 transitions. [2019-10-02 12:04:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-02 12:04:24,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:24,900 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:24,900 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:24,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:24,900 INFO L82 PathProgramCache]: Analyzing trace with hash -212076067, now seen corresponding path program 1 times [2019-10-02 12:04:24,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:24,901 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:24,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:24,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:24,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:25,041 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:04:25,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:25,042 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:25,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:25,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:25,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:25,649 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-02 12:04:25,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:25,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:25,665 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:25,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:25,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:25,665 INFO L87 Difference]: Start difference. First operand 635 states and 1005 transitions. Second operand 6 states. [2019-10-02 12:04:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:25,800 INFO L93 Difference]: Finished difference Result 1233 states and 1970 transitions. [2019-10-02 12:04:25,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:25,801 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-10-02 12:04:25,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:25,815 INFO L225 Difference]: With dead ends: 1233 [2019-10-02 12:04:25,815 INFO L226 Difference]: Without dead ends: 635 [2019-10-02 12:04:25,818 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:25,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-02 12:04:25,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-02 12:04:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-02 12:04:25,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1004 transitions. [2019-10-02 12:04:25,848 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1004 transitions. Word has length 124 [2019-10-02 12:04:25,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:25,848 INFO L475 AbstractCegarLoop]: Abstraction has 635 states and 1004 transitions. [2019-10-02 12:04:25,848 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:25,848 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1004 transitions. [2019-10-02 12:04:25,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:04:25,852 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:25,852 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:25,852 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:25,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:25,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1439359232, now seen corresponding path program 1 times [2019-10-02 12:04:25,853 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:25,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:25,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:25,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:26,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:26,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:26,032 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:26,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:26,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:26,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 3180 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-02 12:04:26,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:26,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:26,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-10-02 12:04:26,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 12:04:26,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 12:04:26,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:26,676 INFO L87 Difference]: Start difference. First operand 635 states and 1004 transitions. Second operand 15 states. [2019-10-02 12:04:26,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:26,891 INFO L93 Difference]: Finished difference Result 1238 states and 1977 transitions. [2019-10-02 12:04:26,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:04:26,891 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 125 [2019-10-02 12:04:26,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:26,900 INFO L225 Difference]: With dead ends: 1238 [2019-10-02 12:04:26,900 INFO L226 Difference]: Without dead ends: 644 [2019-10-02 12:04:26,907 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-10-02 12:04:26,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 644 states. [2019-10-02 12:04:26,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 644 to 642. [2019-10-02 12:04:26,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:04:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 1014 transitions. [2019-10-02 12:04:26,942 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 1014 transitions. Word has length 125 [2019-10-02 12:04:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:26,943 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 1014 transitions. [2019-10-02 12:04:26,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:04:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 1014 transitions. [2019-10-02 12:04:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-02 12:04:26,947 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:26,947 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:26,948 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:26,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1053992449, now seen corresponding path program 1 times [2019-10-02 12:04:26,948 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:26,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:26,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:26,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:27,083 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-02 12:04:27,084 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:27,084 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:27,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:27,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 3179 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:27,670 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:27,696 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:27,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:27,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-10-02 12:04:27,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:27,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:27,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:27,714 INFO L87 Difference]: Start difference. First operand 642 states and 1014 transitions. Second operand 6 states. [2019-10-02 12:04:28,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:28,056 INFO L93 Difference]: Finished difference Result 1245 states and 1988 transitions. [2019-10-02 12:04:28,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:28,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-10-02 12:04:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:28,064 INFO L225 Difference]: With dead ends: 1245 [2019-10-02 12:04:28,064 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:04:28,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:28,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:04:28,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-02 12:04:28,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-02 12:04:28,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 1002 transitions. [2019-10-02 12:04:28,110 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 1002 transitions. Word has length 125 [2019-10-02 12:04:28,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:28,111 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 1002 transitions. [2019-10-02 12:04:28,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 1002 transitions. [2019-10-02 12:04:28,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-02 12:04:28,115 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:28,116 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:28,116 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:28,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:28,117 INFO L82 PathProgramCache]: Analyzing trace with hash -590454864, now seen corresponding path program 1 times [2019-10-02 12:04:28,117 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:28,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:28,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:28,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:28,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:28,310 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:28,310 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:28,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:29,013 INFO L256 TraceCheckSpWp]: Trace formula consists of 3183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:29,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:29,059 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (9)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 12:04:29,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:29,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:29,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:29,078 INFO L87 Difference]: Start difference. First operand 638 states and 1002 transitions. Second operand 8 states. [2019-10-02 12:04:29,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:29,339 INFO L93 Difference]: Finished difference Result 1241 states and 1971 transitions. [2019-10-02 12:04:29,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:29,340 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 128 [2019-10-02 12:04:29,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:29,344 INFO L225 Difference]: With dead ends: 1241 [2019-10-02 12:04:29,345 INFO L226 Difference]: Without dead ends: 638 [2019-10-02 12:04:29,348 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:29,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-02 12:04:29,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 638. [2019-10-02 12:04:29,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2019-10-02 12:04:29,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 997 transitions. [2019-10-02 12:04:29,371 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 997 transitions. Word has length 128 [2019-10-02 12:04:29,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:29,373 INFO L475 AbstractCegarLoop]: Abstraction has 638 states and 997 transitions. [2019-10-02 12:04:29,373 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 997 transitions. [2019-10-02 12:04:29,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-02 12:04:29,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:29,376 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:29,376 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:29,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:29,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1127933560, now seen corresponding path program 1 times [2019-10-02 12:04:29,377 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:29,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:29,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:29,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:29,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:29,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:29,520 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:29,520 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:29,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:30,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:30,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 3181 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-02 12:04:30,116 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:30,272 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:30,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:30,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-10-02 12:04:30,292 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-02 12:04:30,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-02 12:04:30,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:04:30,294 INFO L87 Difference]: Start difference. First operand 638 states and 997 transitions. Second operand 14 states. [2019-10-02 12:04:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:30,734 INFO L93 Difference]: Finished difference Result 1249 states and 1975 transitions. [2019-10-02 12:04:30,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:04:30,735 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 130 [2019-10-02 12:04:30,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:30,743 INFO L225 Difference]: With dead ends: 1249 [2019-10-02 12:04:30,743 INFO L226 Difference]: Without dead ends: 652 [2019-10-02 12:04:30,749 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:04:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2019-10-02 12:04:30,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 648. [2019-10-02 12:04:30,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 648 states. [2019-10-02 12:04:30,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 1015 transitions. [2019-10-02 12:04:30,788 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 1015 transitions. Word has length 130 [2019-10-02 12:04:30,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:30,789 INFO L475 AbstractCegarLoop]: Abstraction has 648 states and 1015 transitions. [2019-10-02 12:04:30,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-02 12:04:30,789 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 1015 transitions. [2019-10-02 12:04:30,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 12:04:30,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:30,795 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:30,795 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:30,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1374979389, now seen corresponding path program 1 times [2019-10-02 12:04:30,796 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:30,797 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:30,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:30,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:30,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:31,034 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:31,035 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:31,035 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:31,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:31,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:31,893 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:31,905 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:31,953 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:31,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:31,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:31,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:31,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:31,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:31,966 INFO L87 Difference]: Start difference. First operand 648 states and 1015 transitions. Second operand 8 states. [2019-10-02 12:04:32,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:32,313 INFO L93 Difference]: Finished difference Result 1283 states and 2032 transitions. [2019-10-02 12:04:32,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:32,313 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 131 [2019-10-02 12:04:32,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:32,318 INFO L225 Difference]: With dead ends: 1283 [2019-10-02 12:04:32,319 INFO L226 Difference]: Without dead ends: 645 [2019-10-02 12:04:32,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:32,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2019-10-02 12:04:32,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 642. [2019-10-02 12:04:32,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:04:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 990 transitions. [2019-10-02 12:04:32,350 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 990 transitions. Word has length 131 [2019-10-02 12:04:32,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:32,351 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 990 transitions. [2019-10-02 12:04:32,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:32,351 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 990 transitions. [2019-10-02 12:04:32,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:04:32,353 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:32,353 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:32,353 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:32,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:32,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1223717190, now seen corresponding path program 1 times [2019-10-02 12:04:32,354 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:32,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:32,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:32,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:32,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:32,494 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:32,495 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:32,495 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:32,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:33,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 3184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:33,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:33,176 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:33,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:33,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:33,193 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:33,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:33,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:33,193 INFO L87 Difference]: Start difference. First operand 642 states and 990 transitions. Second operand 8 states. [2019-10-02 12:04:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:33,406 INFO L93 Difference]: Finished difference Result 1234 states and 1926 transitions. [2019-10-02 12:04:33,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:33,407 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-02 12:04:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:33,412 INFO L225 Difference]: With dead ends: 1234 [2019-10-02 12:04:33,412 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:04:33,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:33,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:04:33,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:04:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:04:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 989 transitions. [2019-10-02 12:04:33,438 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 989 transitions. Word has length 133 [2019-10-02 12:04:33,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:33,440 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 989 transitions. [2019-10-02 12:04:33,440 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 989 transitions. [2019-10-02 12:04:33,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-10-02 12:04:33,442 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:33,443 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:33,443 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:33,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:33,443 INFO L82 PathProgramCache]: Analyzing trace with hash -432225702, now seen corresponding path program 1 times [2019-10-02 12:04:33,443 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:33,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:33,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:33,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-02 12:04:33,601 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:33,601 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:33,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:34,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 3185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 12:04:34,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:04:34,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:34,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-10-02 12:04:34,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:04:34,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:04:34,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:34,167 INFO L87 Difference]: Start difference. First operand 642 states and 989 transitions. Second operand 8 states. [2019-10-02 12:04:34,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:34,354 INFO L93 Difference]: Finished difference Result 1234 states and 1925 transitions. [2019-10-02 12:04:34,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:04:34,354 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 134 [2019-10-02 12:04:34,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:34,360 INFO L225 Difference]: With dead ends: 1234 [2019-10-02 12:04:34,360 INFO L226 Difference]: Without dead ends: 642 [2019-10-02 12:04:34,365 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:34,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2019-10-02 12:04:34,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 642. [2019-10-02 12:04:34,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-10-02 12:04:34,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 988 transitions. [2019-10-02 12:04:34,396 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 988 transitions. Word has length 134 [2019-10-02 12:04:34,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:34,396 INFO L475 AbstractCegarLoop]: Abstraction has 642 states and 988 transitions. [2019-10-02 12:04:34,396 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:04:34,396 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 988 transitions. [2019-10-02 12:04:34,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-02 12:04:34,398 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:34,399 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:34,399 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:34,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:34,399 INFO L82 PathProgramCache]: Analyzing trace with hash -119779371, now seen corresponding path program 1 times [2019-10-02 12:04:34,399 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:34,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:34,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:34,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:34,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:34,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:34,613 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:04:34,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:04:34,613 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:04:34,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:35,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 3186 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 12:04:35,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:04:35,231 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:04:35,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 12:04:35,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-10-02 12:04:35,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 12:04:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 12:04:35,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:35,242 INFO L87 Difference]: Start difference. First operand 642 states and 988 transitions. Second operand 18 states. [2019-10-02 12:04:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:35,873 INFO L93 Difference]: Finished difference Result 1250 states and 1952 transitions. [2019-10-02 12:04:35,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:04:35,874 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 135 [2019-10-02 12:04:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:35,882 INFO L225 Difference]: With dead ends: 1250 [2019-10-02 12:04:35,882 INFO L226 Difference]: Without dead ends: 657 [2019-10-02 12:04:35,887 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:04:35,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2019-10-02 12:04:35,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 653. [2019-10-02 12:04:35,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2019-10-02 12:04:35,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 996 transitions. [2019-10-02 12:04:35,926 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 996 transitions. Word has length 135 [2019-10-02 12:04:35,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:35,926 INFO L475 AbstractCegarLoop]: Abstraction has 653 states and 996 transitions. [2019-10-02 12:04:35,927 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 12:04:35,927 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 996 transitions. [2019-10-02 12:04:35,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-02 12:04:35,929 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:35,929 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:35,929 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:35,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:35,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1507177232, now seen corresponding path program 1 times [2019-10-02 12:04:35,930 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:35,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:35,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:35,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:35,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:35,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:36,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 12:04:36,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:36,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:04:36,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:04:36,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:04:36,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:04:36,091 INFO L87 Difference]: Start difference. First operand 653 states and 996 transitions. Second operand 7 states. [2019-10-02 12:04:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:36,180 INFO L93 Difference]: Finished difference Result 1181 states and 1848 transitions. [2019-10-02 12:04:36,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:04:36,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-10-02 12:04:36,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:36,185 INFO L225 Difference]: With dead ends: 1181 [2019-10-02 12:04:36,185 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:04:36,188 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:36,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:04:36,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-10-02 12:04:36,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-02 12:04:36,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 961 transitions. [2019-10-02 12:04:36,208 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 961 transitions. Word has length 136 [2019-10-02 12:04:36,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:36,208 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 961 transitions. [2019-10-02 12:04:36,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:04:36,209 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 961 transitions. [2019-10-02 12:04:36,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-02 12:04:36,211 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:36,211 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:36,211 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:36,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:36,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1390498898, now seen corresponding path program 1 times [2019-10-02 12:04:36,212 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:36,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:36,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:36,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:36,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:36,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:36,422 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:04:36,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:36,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:04:36,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:04:36,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:04:36,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:36,424 INFO L87 Difference]: Start difference. First operand 627 states and 961 transitions. Second operand 13 states. [2019-10-02 12:04:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:36,759 INFO L93 Difference]: Finished difference Result 1156 states and 1811 transitions. [2019-10-02 12:04:36,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 12:04:36,759 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 137 [2019-10-02 12:04:36,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:36,764 INFO L225 Difference]: With dead ends: 1156 [2019-10-02 12:04:36,764 INFO L226 Difference]: Without dead ends: 620 [2019-10-02 12:04:36,769 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-10-02 12:04:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-10-02 12:04:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-10-02 12:04:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 952 transitions. [2019-10-02 12:04:36,789 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 952 transitions. Word has length 137 [2019-10-02 12:04:36,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:36,789 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 952 transitions. [2019-10-02 12:04:36,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:04:36,789 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 952 transitions. [2019-10-02 12:04:36,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-02 12:04:36,792 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:36,792 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:36,792 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:36,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:36,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1390861475, now seen corresponding path program 1 times [2019-10-02 12:04:36,793 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:36,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:36,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:36,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:37,054 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:04:37,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:37,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-02 12:04:37,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 12:04:37,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 12:04:37,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-10-02 12:04:37,056 INFO L87 Difference]: Start difference. First operand 620 states and 952 transitions. Second operand 13 states. [2019-10-02 12:04:37,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:37,459 INFO L93 Difference]: Finished difference Result 1207 states and 1879 transitions. [2019-10-02 12:04:37,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:04:37,460 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 138 [2019-10-02 12:04:37,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:37,467 INFO L225 Difference]: With dead ends: 1207 [2019-10-02 12:04:37,467 INFO L226 Difference]: Without dead ends: 634 [2019-10-02 12:04:37,472 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-10-02 12:04:37,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2019-10-02 12:04:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 632. [2019-10-02 12:04:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 12:04:37,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 967 transitions. [2019-10-02 12:04:37,500 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 967 transitions. Word has length 138 [2019-10-02 12:04:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:37,503 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 967 transitions. [2019-10-02 12:04:37,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 12:04:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 967 transitions. [2019-10-02 12:04:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:04:37,507 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:37,508 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:37,508 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:37,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:37,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1440898157, now seen corresponding path program 1 times [2019-10-02 12:04:37,509 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:37,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:37,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:37,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:37,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:37,717 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:04:37,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:37,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:04:37,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:37,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:37,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:37,723 INFO L87 Difference]: Start difference. First operand 632 states and 967 transitions. Second operand 11 states. [2019-10-02 12:04:37,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:37,951 INFO L93 Difference]: Finished difference Result 1161 states and 1817 transitions. [2019-10-02 12:04:37,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:04:37,952 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 139 [2019-10-02 12:04:37,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:37,957 INFO L225 Difference]: With dead ends: 1161 [2019-10-02 12:04:37,957 INFO L226 Difference]: Without dead ends: 632 [2019-10-02 12:04:37,960 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:37,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2019-10-02 12:04:37,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 632. [2019-10-02 12:04:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2019-10-02 12:04:37,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 966 transitions. [2019-10-02 12:04:37,979 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 966 transitions. Word has length 139 [2019-10-02 12:04:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:37,980 INFO L475 AbstractCegarLoop]: Abstraction has 632 states and 966 transitions. [2019-10-02 12:04:37,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:37,980 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 966 transitions. [2019-10-02 12:04:37,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 12:04:37,982 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:37,983 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:37,983 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:37,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:37,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1563463388, now seen corresponding path program 1 times [2019-10-02 12:04:37,983 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:37,983 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:37,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:37,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:37,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-02 12:04:38,180 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:38,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:04:38,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:04:38,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:04:38,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:04:38,182 INFO L87 Difference]: Start difference. First operand 632 states and 966 transitions. Second operand 11 states. [2019-10-02 12:04:38,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:38,470 INFO L93 Difference]: Finished difference Result 1207 states and 1870 transitions. [2019-10-02 12:04:38,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:04:38,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 140 [2019-10-02 12:04:38,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:38,478 INFO L225 Difference]: With dead ends: 1207 [2019-10-02 12:04:38,478 INFO L226 Difference]: Without dead ends: 629 [2019-10-02 12:04:38,481 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 12:04:38,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-10-02 12:04:38,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-10-02 12:04:38,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-10-02 12:04:38,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 958 transitions. [2019-10-02 12:04:38,506 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 958 transitions. Word has length 140 [2019-10-02 12:04:38,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:38,506 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 958 transitions. [2019-10-02 12:04:38,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:04:38,507 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 958 transitions. [2019-10-02 12:04:38,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 12:04:38,510 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:38,511 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:38,511 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:38,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:38,511 INFO L82 PathProgramCache]: Analyzing trace with hash -1412378418, now seen corresponding path program 1 times [2019-10-02 12:04:38,512 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:38,512 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:38,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:38,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:38,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:38,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:38,707 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-02 12:04:38,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:38,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:38,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:38,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:38,710 INFO L87 Difference]: Start difference. First operand 629 states and 958 transitions. Second operand 6 states. [2019-10-02 12:04:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:42,421 INFO L93 Difference]: Finished difference Result 1779 states and 2832 transitions. [2019-10-02 12:04:42,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:04:42,422 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-02 12:04:42,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:42,430 INFO L225 Difference]: With dead ends: 1779 [2019-10-02 12:04:42,430 INFO L226 Difference]: Without dead ends: 1259 [2019-10-02 12:04:42,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:04:42,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2019-10-02 12:04:42,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 1143. [2019-10-02 12:04:42,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1143 states. [2019-10-02 12:04:42,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1143 states to 1143 states and 1804 transitions. [2019-10-02 12:04:42,504 INFO L78 Accepts]: Start accepts. Automaton has 1143 states and 1804 transitions. Word has length 141 [2019-10-02 12:04:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:42,506 INFO L475 AbstractCegarLoop]: Abstraction has 1143 states and 1804 transitions. [2019-10-02 12:04:42,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1143 states and 1804 transitions. [2019-10-02 12:04:42,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-10-02 12:04:42,512 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:42,512 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:42,513 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1784115059, now seen corresponding path program 1 times [2019-10-02 12:04:42,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:42,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:42,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:42,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:42,747 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:42,747 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:42,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:04:42,748 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:04:42,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:04:42,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:04:42,750 INFO L87 Difference]: Start difference. First operand 1143 states and 1804 transitions. Second operand 12 states. [2019-10-02 12:04:52,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:52,632 INFO L93 Difference]: Finished difference Result 3625 states and 5796 transitions. [2019-10-02 12:04:52,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:04:52,632 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 190 [2019-10-02 12:04:52,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:52,649 INFO L225 Difference]: With dead ends: 3625 [2019-10-02 12:04:52,649 INFO L226 Difference]: Without dead ends: 2591 [2019-10-02 12:04:52,656 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:04:52,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2591 states. [2019-10-02 12:04:52,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2591 to 2533. [2019-10-02 12:04:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2533 states. [2019-10-02 12:04:52,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2533 states to 2533 states and 4003 transitions. [2019-10-02 12:04:52,823 INFO L78 Accepts]: Start accepts. Automaton has 2533 states and 4003 transitions. Word has length 190 [2019-10-02 12:04:52,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:52,823 INFO L475 AbstractCegarLoop]: Abstraction has 2533 states and 4003 transitions. [2019-10-02 12:04:52,824 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:04:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 2533 states and 4003 transitions. [2019-10-02 12:04:52,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-10-02 12:04:52,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:52,834 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:52,834 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:52,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:52,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1972041240, now seen corresponding path program 1 times [2019-10-02 12:04:52,837 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:52,837 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:52,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:52,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:52,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:53,027 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:53,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:53,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:53,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:53,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:53,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:53,028 INFO L87 Difference]: Start difference. First operand 2533 states and 4003 transitions. Second operand 6 states. [2019-10-02 12:04:57,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:04:57,622 INFO L93 Difference]: Finished difference Result 6444 states and 10418 transitions. [2019-10-02 12:04:57,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:04:57,623 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 191 [2019-10-02 12:04:57,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:04:57,661 INFO L225 Difference]: With dead ends: 6444 [2019-10-02 12:04:57,661 INFO L226 Difference]: Without dead ends: 4022 [2019-10-02 12:04:57,684 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:04:57,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4022 states. [2019-10-02 12:04:57,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4022 to 3786. [2019-10-02 12:04:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3786 states. [2019-10-02 12:04:58,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3786 states to 3786 states and 5974 transitions. [2019-10-02 12:04:58,012 INFO L78 Accepts]: Start accepts. Automaton has 3786 states and 5974 transitions. Word has length 191 [2019-10-02 12:04:58,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:58,013 INFO L475 AbstractCegarLoop]: Abstraction has 3786 states and 5974 transitions. [2019-10-02 12:04:58,013 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:04:58,013 INFO L276 IsEmpty]: Start isEmpty. Operand 3786 states and 5974 transitions. [2019-10-02 12:04:58,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 12:04:58,024 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:58,024 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:58,025 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:58,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:58,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1152985773, now seen corresponding path program 1 times [2019-10-02 12:04:58,025 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:58,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:58,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:58,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:58,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:04:58,315 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:04:58,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:04:58,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:04:58,317 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:04:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:04:58,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:04:58,318 INFO L87 Difference]: Start difference. First operand 3786 states and 5974 transitions. Second operand 6 states. [2019-10-02 12:05:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:02,275 INFO L93 Difference]: Finished difference Result 10560 states and 17066 transitions. [2019-10-02 12:05:02,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:02,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 192 [2019-10-02 12:05:02,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:02,322 INFO L225 Difference]: With dead ends: 10560 [2019-10-02 12:05:02,323 INFO L226 Difference]: Without dead ends: 6886 [2019-10-02 12:05:02,344 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:02,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2019-10-02 12:05:02,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6472. [2019-10-02 12:05:02,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6472 states. [2019-10-02 12:05:02,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6472 states to 6472 states and 10228 transitions. [2019-10-02 12:05:02,750 INFO L78 Accepts]: Start accepts. Automaton has 6472 states and 10228 transitions. Word has length 192 [2019-10-02 12:05:02,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:02,751 INFO L475 AbstractCegarLoop]: Abstraction has 6472 states and 10228 transitions. [2019-10-02 12:05:02,751 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:02,751 INFO L276 IsEmpty]: Start isEmpty. Operand 6472 states and 10228 transitions. [2019-10-02 12:05:02,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-10-02 12:05:02,759 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:02,759 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:02,759 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:02,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:02,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1643225980, now seen corresponding path program 1 times [2019-10-02 12:05:02,760 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:02,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:02,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:02,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:02,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:02,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:02,933 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:02,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:02,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:02,933 INFO L87 Difference]: Start difference. First operand 6472 states and 10228 transitions. Second operand 6 states. [2019-10-02 12:05:07,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:07,127 INFO L93 Difference]: Finished difference Result 19649 states and 31903 transitions. [2019-10-02 12:05:07,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:07,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 193 [2019-10-02 12:05:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:07,207 INFO L225 Difference]: With dead ends: 19649 [2019-10-02 12:05:07,207 INFO L226 Difference]: Without dead ends: 13291 [2019-10-02 12:05:07,241 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13291 states. [2019-10-02 12:05:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13291 to 12364. [2019-10-02 12:05:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12364 states. [2019-10-02 12:05:08,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12364 states to 12364 states and 19632 transitions. [2019-10-02 12:05:08,560 INFO L78 Accepts]: Start accepts. Automaton has 12364 states and 19632 transitions. Word has length 193 [2019-10-02 12:05:08,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:08,560 INFO L475 AbstractCegarLoop]: Abstraction has 12364 states and 19632 transitions. [2019-10-02 12:05:08,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:08,560 INFO L276 IsEmpty]: Start isEmpty. Operand 12364 states and 19632 transitions. [2019-10-02 12:05:08,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-02 12:05:08,568 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:08,568 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:08,568 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:08,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -980721545, now seen corresponding path program 1 times [2019-10-02 12:05:08,570 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:08,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:08,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:08,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:08,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:08,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:08,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:08,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:08,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:08,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:08,739 INFO L87 Difference]: Start difference. First operand 12364 states and 19632 transitions. Second operand 6 states. [2019-10-02 12:05:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:13,219 INFO L93 Difference]: Finished difference Result 40396 states and 66218 transitions. [2019-10-02 12:05:13,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:13,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 194 [2019-10-02 12:05:13,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:13,402 INFO L225 Difference]: With dead ends: 40396 [2019-10-02 12:05:13,402 INFO L226 Difference]: Without dead ends: 28150 [2019-10-02 12:05:13,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:13,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28150 states. [2019-10-02 12:05:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28150 to 25712. [2019-10-02 12:05:15,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25712 states. [2019-10-02 12:05:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25712 states to 25712 states and 41150 transitions. [2019-10-02 12:05:15,231 INFO L78 Accepts]: Start accepts. Automaton has 25712 states and 41150 transitions. Word has length 194 [2019-10-02 12:05:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:15,232 INFO L475 AbstractCegarLoop]: Abstraction has 25712 states and 41150 transitions. [2019-10-02 12:05:15,232 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:15,232 INFO L276 IsEmpty]: Start isEmpty. Operand 25712 states and 41150 transitions. [2019-10-02 12:05:15,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:05:15,240 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:15,240 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:15,241 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:15,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:15,241 INFO L82 PathProgramCache]: Analyzing trace with hash 169085152, now seen corresponding path program 1 times [2019-10-02 12:05:15,241 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:15,241 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:15,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:15,392 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:15,392 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:15,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:05:15,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:05:15,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:05:15,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:05:15,394 INFO L87 Difference]: Start difference. First operand 25712 states and 41150 transitions. Second operand 6 states. [2019-10-02 12:05:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:21,735 INFO L93 Difference]: Finished difference Result 89723 states and 149087 transitions. [2019-10-02 12:05:21,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 12:05:21,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 195 [2019-10-02 12:05:21,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:22,080 INFO L225 Difference]: With dead ends: 89723 [2019-10-02 12:05:22,081 INFO L226 Difference]: Without dead ends: 64137 [2019-10-02 12:05:22,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:05:22,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64137 states. [2019-10-02 12:05:24,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64137 to 57180. [2019-10-02 12:05:24,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57180 states. [2019-10-02 12:05:25,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57180 states to 57180 states and 92506 transitions. [2019-10-02 12:05:25,166 INFO L78 Accepts]: Start accepts. Automaton has 57180 states and 92506 transitions. Word has length 195 [2019-10-02 12:05:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:25,167 INFO L475 AbstractCegarLoop]: Abstraction has 57180 states and 92506 transitions. [2019-10-02 12:05:25,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:05:25,167 INFO L276 IsEmpty]: Start isEmpty. Operand 57180 states and 92506 transitions. [2019-10-02 12:05:25,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 12:05:25,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:25,174 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:25,174 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:25,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:25,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1756448159, now seen corresponding path program 1 times [2019-10-02 12:05:25,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:25,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:25,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:25,347 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:25,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:25,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:05:25,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:05:25,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:05:25,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:05:25,349 INFO L87 Difference]: Start difference. First operand 57180 states and 92506 transitions. Second operand 9 states. [2019-10-02 12:05:36,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:36,734 INFO L93 Difference]: Finished difference Result 189838 states and 311562 transitions. [2019-10-02 12:05:36,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-02 12:05:36,735 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2019-10-02 12:05:36,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:37,333 INFO L225 Difference]: With dead ends: 189838 [2019-10-02 12:05:37,333 INFO L226 Difference]: Without dead ends: 132800 [2019-10-02 12:05:37,508 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-10-02 12:05:37,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132800 states. [2019-10-02 12:05:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132800 to 130341. [2019-10-02 12:05:46,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130341 states. [2019-10-02 12:05:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130341 states to 130341 states and 210651 transitions. [2019-10-02 12:05:50,525 INFO L78 Accepts]: Start accepts. Automaton has 130341 states and 210651 transitions. Word has length 195 [2019-10-02 12:05:50,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:05:50,525 INFO L475 AbstractCegarLoop]: Abstraction has 130341 states and 210651 transitions. [2019-10-02 12:05:50,526 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:05:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 130341 states and 210651 transitions. [2019-10-02 12:05:50,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:05:50,532 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:05:50,533 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:05:50,533 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:05:50,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:05:50,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1788292938, now seen corresponding path program 1 times [2019-10-02 12:05:50,534 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:05:50,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:05:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:50,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:05:50,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:05:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:05:50,684 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:05:50,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:05:50,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:05:50,689 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:05:50,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:05:50,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:50,690 INFO L87 Difference]: Start difference. First operand 130341 states and 210651 transitions. Second operand 7 states. [2019-10-02 12:05:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:05:58,861 INFO L93 Difference]: Finished difference Result 264401 states and 428478 transitions. [2019-10-02 12:05:58,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:05:58,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-10-02 12:05:58,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:05:59,408 INFO L225 Difference]: With dead ends: 264401 [2019-10-02 12:05:59,409 INFO L226 Difference]: Without dead ends: 134202 [2019-10-02 12:05:59,676 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:05:59,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134202 states. [2019-10-02 12:06:05,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134202 to 132420. [2019-10-02 12:06:05,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132420 states. [2019-10-02 12:06:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132420 states to 132420 states and 213621 transitions. [2019-10-02 12:06:05,971 INFO L78 Accepts]: Start accepts. Automaton has 132420 states and 213621 transitions. Word has length 201 [2019-10-02 12:06:05,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:05,971 INFO L475 AbstractCegarLoop]: Abstraction has 132420 states and 213621 transitions. [2019-10-02 12:06:05,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:06:05,971 INFO L276 IsEmpty]: Start isEmpty. Operand 132420 states and 213621 transitions. [2019-10-02 12:06:05,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-10-02 12:06:05,980 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:05,980 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:05,980 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:05,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:05,981 INFO L82 PathProgramCache]: Analyzing trace with hash 887582067, now seen corresponding path program 1 times [2019-10-02 12:06:05,981 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:05,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:05,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:05,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:06,111 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:06:06,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:06,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:06:06,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:06:06,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:06:06,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:06,112 INFO L87 Difference]: Start difference. First operand 132420 states and 213621 transitions. Second operand 7 states. [2019-10-02 12:06:14,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:14,750 INFO L93 Difference]: Finished difference Result 267965 states and 433230 transitions. [2019-10-02 12:06:14,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:06:14,750 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 200 [2019-10-02 12:06:14,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:15,297 INFO L225 Difference]: With dead ends: 267965 [2019-10-02 12:06:15,297 INFO L226 Difference]: Without dead ends: 135687 [2019-10-02 12:06:15,569 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:06:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135687 states. [2019-10-02 12:06:21,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135687 to 132717. [2019-10-02 12:06:21,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132717 states. [2019-10-02 12:06:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132717 states to 132717 states and 213918 transitions. [2019-10-02 12:06:22,432 INFO L78 Accepts]: Start accepts. Automaton has 132717 states and 213918 transitions. Word has length 200 [2019-10-02 12:06:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:22,433 INFO L475 AbstractCegarLoop]: Abstraction has 132717 states and 213918 transitions. [2019-10-02 12:06:22,433 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:06:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 132717 states and 213918 transitions. [2019-10-02 12:06:22,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-10-02 12:06:22,440 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:22,440 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:22,440 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1273918712, now seen corresponding path program 1 times [2019-10-02 12:06:22,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:22,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:22,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:22,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:22,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:22,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:22,564 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:06:22,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:22,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:06:22,565 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:06:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:06:22,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:06:22,566 INFO L87 Difference]: Start difference. First operand 132717 states and 213918 transitions. Second operand 5 states. [2019-10-02 12:06:32,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:06:32,467 INFO L93 Difference]: Finished difference Result 266732 states and 429751 transitions. [2019-10-02 12:06:32,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:06:32,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 201 [2019-10-02 12:06:32,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:06:33,075 INFO L225 Difference]: With dead ends: 266732 [2019-10-02 12:06:33,075 INFO L226 Difference]: Without dead ends: 134157 [2019-10-02 12:06:33,844 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:06:33,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134157 states. [2019-10-02 12:06:42,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134157 to 132669. [2019-10-02 12:06:42,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132669 states. [2019-10-02 12:06:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132669 states to 132669 states and 213804 transitions. [2019-10-02 12:06:43,384 INFO L78 Accepts]: Start accepts. Automaton has 132669 states and 213804 transitions. Word has length 201 [2019-10-02 12:06:43,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:06:43,385 INFO L475 AbstractCegarLoop]: Abstraction has 132669 states and 213804 transitions. [2019-10-02 12:06:43,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:06:43,385 INFO L276 IsEmpty]: Start isEmpty. Operand 132669 states and 213804 transitions. [2019-10-02 12:06:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-02 12:06:43,393 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:06:43,394 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:06:43,394 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:06:43,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:06:43,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1926027954, now seen corresponding path program 1 times [2019-10-02 12:06:43,394 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:06:43,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:06:43,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:43,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:06:43,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:06:43,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:06:43,612 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:06:43,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:06:43,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:06:43,614 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:06:43,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:06:43,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:06:43,614 INFO L87 Difference]: Start difference. First operand 132669 states and 213804 transitions. Second operand 8 states. [2019-10-02 12:07:05,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:05,585 INFO L93 Difference]: Finished difference Result 415680 states and 684400 transitions. [2019-10-02 12:07:05,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:07:05,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 210 [2019-10-02 12:07:05,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:07,284 INFO L225 Difference]: With dead ends: 415680 [2019-10-02 12:07:07,284 INFO L226 Difference]: Without dead ends: 283153 [2019-10-02 12:07:07,622 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:07:07,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283153 states. [2019-10-02 12:07:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283153 to 283055. [2019-10-02 12:07:26,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283055 states. [2019-10-02 12:07:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283055 states to 283055 states and 460434 transitions. [2019-10-02 12:07:28,771 INFO L78 Accepts]: Start accepts. Automaton has 283055 states and 460434 transitions. Word has length 210 [2019-10-02 12:07:28,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:07:28,771 INFO L475 AbstractCegarLoop]: Abstraction has 283055 states and 460434 transitions. [2019-10-02 12:07:28,771 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:07:28,771 INFO L276 IsEmpty]: Start isEmpty. Operand 283055 states and 460434 transitions. [2019-10-02 12:07:28,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:07:28,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:07:28,779 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:07:28,780 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:07:28,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:07:28,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1651888903, now seen corresponding path program 1 times [2019-10-02 12:07:28,780 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:07:28,780 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:07:28,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:28,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:07:28,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:07:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:07:28,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:07:28,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:07:28,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:07:28,936 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:07:28,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:07:28,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:07:28,937 INFO L87 Difference]: Start difference. First operand 283055 states and 460434 transitions. Second operand 7 states. [2019-10-02 12:07:50,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:07:50,497 INFO L93 Difference]: Finished difference Result 568740 states and 945819 transitions. [2019-10-02 12:07:50,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:07:50,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 212 [2019-10-02 12:07:50,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:07:52,536 INFO L225 Difference]: With dead ends: 568740 [2019-10-02 12:07:52,537 INFO L226 Difference]: Without dead ends: 285563 [2019-10-02 12:07:53,211 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:07:53,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285563 states. [2019-10-02 12:08:16,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285563 to 285563. [2019-10-02 12:08:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285563 states. [2019-10-02 12:08:18,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285563 states to 285563 states and 462579 transitions. [2019-10-02 12:08:18,811 INFO L78 Accepts]: Start accepts. Automaton has 285563 states and 462579 transitions. Word has length 212 [2019-10-02 12:08:18,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:08:18,812 INFO L475 AbstractCegarLoop]: Abstraction has 285563 states and 462579 transitions. [2019-10-02 12:08:18,812 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:08:18,812 INFO L276 IsEmpty]: Start isEmpty. Operand 285563 states and 462579 transitions. [2019-10-02 12:08:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-02 12:08:18,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:08:18,817 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:08:18,818 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:08:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:08:18,818 INFO L82 PathProgramCache]: Analyzing trace with hash -583448584, now seen corresponding path program 1 times [2019-10-02 12:08:18,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:08:18,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:08:18,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:18,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:08:18,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:08:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:08:18,973 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-02 12:08:18,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:08:18,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:08:18,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:08:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:08:18,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:08:18,975 INFO L87 Difference]: Start difference. First operand 285563 states and 462579 transitions. Second operand 7 states. [2019-10-02 12:08:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:08:42,865 INFO L93 Difference]: Finished difference Result 561470 states and 918326 transitions. [2019-10-02 12:08:42,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:08:42,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 212 [2019-10-02 12:08:42,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:08:45,287 INFO L225 Difference]: With dead ends: 561470 [2019-10-02 12:08:45,288 INFO L226 Difference]: Without dead ends: 303006 [2019-10-02 12:08:45,842 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:08:46,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303006 states. [2019-10-02 12:09:16,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303006 to 297245. [2019-10-02 12:09:16,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297245 states. [2019-10-02 12:09:18,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297245 states to 297245 states and 478512 transitions. [2019-10-02 12:09:18,631 INFO L78 Accepts]: Start accepts. Automaton has 297245 states and 478512 transitions. Word has length 212 [2019-10-02 12:09:18,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:09:18,631 INFO L475 AbstractCegarLoop]: Abstraction has 297245 states and 478512 transitions. [2019-10-02 12:09:18,632 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:09:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 297245 states and 478512 transitions. [2019-10-02 12:09:18,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:09:18,638 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:09:18,638 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:09:18,638 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:09:18,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:09:18,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1968683326, now seen corresponding path program 1 times [2019-10-02 12:09:18,638 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:09:18,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:09:18,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:18,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:09:18,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:09:18,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:09:18,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:09:18,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:09:18,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:09:18,774 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:09:18,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:09:18,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:09:18,775 INFO L87 Difference]: Start difference. First operand 297245 states and 478512 transitions. Second operand 6 states. [2019-10-02 12:09:44,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:09:44,491 INFO L93 Difference]: Finished difference Result 660810 states and 1071912 transitions. [2019-10-02 12:09:44,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:09:44,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-10-02 12:09:44,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:09:47,274 INFO L225 Difference]: With dead ends: 660810 [2019-10-02 12:09:47,274 INFO L226 Difference]: Without dead ends: 390664 [2019-10-02 12:09:47,859 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:09:48,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390664 states. [2019-10-02 12:10:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390664 to 365339. [2019-10-02 12:10:17,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365339 states. [2019-10-02 12:10:20,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365339 states to 365339 states and 591015 transitions. [2019-10-02 12:10:20,844 INFO L78 Accepts]: Start accepts. Automaton has 365339 states and 591015 transitions. Word has length 218 [2019-10-02 12:10:20,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:10:20,844 INFO L475 AbstractCegarLoop]: Abstraction has 365339 states and 591015 transitions. [2019-10-02 12:10:20,844 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:10:20,845 INFO L276 IsEmpty]: Start isEmpty. Operand 365339 states and 591015 transitions. [2019-10-02 12:10:20,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-02 12:10:20,851 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:10:20,852 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:10:20,852 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:10:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:10:20,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1376563929, now seen corresponding path program 1 times [2019-10-02 12:10:20,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:10:20,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:10:20,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:20,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:10:20,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:10:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:10:21,003 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:10:21,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:10:21,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:10:21,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:10:21,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:10:21,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:10:21,004 INFO L87 Difference]: Start difference. First operand 365339 states and 591015 transitions. Second operand 4 states. [2019-10-02 12:10:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:10:49,952 INFO L93 Difference]: Finished difference Result 727136 states and 1209904 transitions. [2019-10-02 12:10:49,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:10:49,953 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 217 [2019-10-02 12:10:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:10:52,827 INFO L225 Difference]: With dead ends: 727136 [2019-10-02 12:10:52,827 INFO L226 Difference]: Without dead ends: 361906 [2019-10-02 12:10:53,724 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:10:53,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361906 states. [2019-10-02 12:11:25,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361906 to 361906. [2019-10-02 12:11:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361906 states. [2019-10-02 12:11:29,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361906 states to 361906 states and 584149 transitions. [2019-10-02 12:11:29,167 INFO L78 Accepts]: Start accepts. Automaton has 361906 states and 584149 transitions. Word has length 217 [2019-10-02 12:11:29,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:11:29,167 INFO L475 AbstractCegarLoop]: Abstraction has 361906 states and 584149 transitions. [2019-10-02 12:11:29,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:11:29,167 INFO L276 IsEmpty]: Start isEmpty. Operand 361906 states and 584149 transitions. [2019-10-02 12:11:29,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-10-02 12:11:29,174 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:11:29,175 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:11:29,175 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:11:29,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:11:29,175 INFO L82 PathProgramCache]: Analyzing trace with hash 275892888, now seen corresponding path program 1 times [2019-10-02 12:11:29,176 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:11:29,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:11:29,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:29,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:11:29,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:11:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:11:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-02 12:11:29,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:11:29,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:11:29,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:11:29,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:11:29,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:11:29,448 INFO L87 Difference]: Start difference. First operand 361906 states and 584149 transitions. Second operand 9 states. [2019-10-02 12:12:36,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:12:36,316 INFO L93 Difference]: Finished difference Result 1131082 states and 1886534 transitions. [2019-10-02 12:12:36,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 12:12:36,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 218 [2019-10-02 12:12:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:12:41,964 INFO L225 Difference]: With dead ends: 1131082 [2019-10-02 12:12:41,964 INFO L226 Difference]: Without dead ends: 769285 [2019-10-02 12:12:43,015 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:12:44,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769285 states. [2019-10-02 12:13:54,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769285 to 735981. [2019-10-02 12:13:54,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735981 states.