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_product21.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:50:48,018 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:50:48,020 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:50:48,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:50:48,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:50:48,038 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:50:48,040 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:50:48,041 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:50:48,043 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:50:48,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:50:48,045 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:50:48,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:50:48,046 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:50:48,047 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:50:48,048 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:50:48,049 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:50:48,050 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:50:48,051 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:50:48,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:50:48,056 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:50:48,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:50:48,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:50:48,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:50:48,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:50:48,071 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:50:48,072 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:50:48,072 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:50:48,073 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:50:48,073 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:50:48,075 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:50:48,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:50:48,076 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:50:48,077 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:50:48,078 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:50:48,082 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:50:48,083 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:50:48,083 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:50:48,084 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:50:48,084 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:50:48,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:50:48,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:50:48,088 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:50:48,107 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:50:48,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:50:48,108 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:50:48,109 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:50:48,109 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:50:48,109 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:50:48,109 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:50:48,110 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:50:48,110 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:50:48,110 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:50:48,110 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:50:48,110 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:50:48,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:50:48,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:50:48,111 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:50:48,111 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:50:48,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:50:48,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:50:48,112 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:50:48,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:50:48,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:50:48,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:50:48,113 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:50:48,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:50:48,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:50:48,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:50:48,114 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:50:48,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:50:48,114 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:50:48,144 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:50:48,162 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:50:48,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:50:48,168 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:50:48,168 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:50:48,169 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec1_product21.cil.c [2019-09-08 03:50:48,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3d4393a/f35a0ce2be3444fda7838f40e6d9287b/FLAG632838f2c [2019-09-08 03:50:48,933 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:50:48,934 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec1_product21.cil.c [2019-09-08 03:50:48,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3d4393a/f35a0ce2be3444fda7838f40e6d9287b/FLAG632838f2c [2019-09-08 03:50:49,138 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe3d4393a/f35a0ce2be3444fda7838f40e6d9287b [2019-09-08 03:50:49,148 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:50:49,150 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:50:49,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:50:49,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:50:49,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:50:49,156 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:50:49" (1/1) ... [2019-09-08 03:50:49,159 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6fa32137 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:49, skipping insertion in model container [2019-09-08 03:50:49,159 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:50:49" (1/1) ... [2019-09-08 03:50:49,166 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:50:49,250 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:50:50,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:50:50,037 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:50:50,184 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:50:50,263 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:50:50,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50 WrapperNode [2019-09-08 03:50:50,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:50:50,266 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:50:50,267 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:50:50,267 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:50:50,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (1/1) ... [2019-09-08 03:50:50,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (1/1) ... [2019-09-08 03:50:50,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (1/1) ... [2019-09-08 03:50:50,365 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (1/1) ... [2019-09-08 03:50:50,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (1/1) ... [2019-09-08 03:50:50,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (1/1) ... [2019-09-08 03:50:50,483 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (1/1) ... [2019-09-08 03:50:50,505 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:50:50,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:50:50,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:50:50,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:50:50,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:50:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:50:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:50:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:50:50,578 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:50:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:50:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:50:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:50:50,579 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:50:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:50:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:50:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:50:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:50:50,580 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:50:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:50:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:50:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:50:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:50:50,581 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:50:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:50:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 03:50:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:50:50,582 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:50:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:50:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 03:50:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:50:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:50:50,583 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:50:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:50:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:50:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:50:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:50:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:50:50,584 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:50:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:50:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:50:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:50:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:50:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:50:50,585 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:50:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:50:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:50:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:50:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:50:50,586 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:50:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:50:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:50:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:50:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:50:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:50:50,587 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:50:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:50:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:50:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:50:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:50:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:50:50,588 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:50:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:50:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:50:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:50:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:50:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:50:50,589 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:50:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:50:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:50:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:50:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:50:50,590 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:50:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:50:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:50:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:50:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:50:50,591 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:50:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:50:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:50:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:50:50,592 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:50:50,592 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:50:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:50:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:50:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:50:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:50:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:50:50,593 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:50:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:50:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:50:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:50:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:50:50,594 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:50:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:50:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:50:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:50:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:50:50,595 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:50:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:50:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:50:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:50:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:50:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:50:50,596 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:50:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:50:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:50:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:50:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:50:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:50:50,597 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:50:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:50:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 03:50:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:50:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:50:50,598 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 03:50:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:50:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:50:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:50:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__3 [2019-09-08 03:50:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:50:50,599 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:50:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:50:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:50:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:50:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:50:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:50:50,600 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:50:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:50:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:50:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:50:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:50:50,601 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:50:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:50:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:50:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:50:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:50:50,602 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:50:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:50:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:50:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__1 [2019-09-08 03:50:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__4 [2019-09-08 03:50:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:50:50,603 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:50:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:50:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:50:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:50:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:50:50,604 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:50:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:50:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:50:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:50:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:50:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:50:50,605 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:50:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:50:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:50:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:50:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:50:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:50:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:50:50,606 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:50:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:50:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:50:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:50:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:50:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:50:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:50:50,607 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification1_spec__2 [2019-09-08 03:50:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:50:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:50:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:50:50,608 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:50:52,794 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:50:52,794 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:50:52,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:50:52 BoogieIcfgContainer [2019-09-08 03:50:52,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:50:52,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:50:52,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:50:52,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:50:52,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:50:49" (1/3) ... [2019-09-08 03:50:52,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192cbdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:50:52, skipping insertion in model container [2019-09-08 03:50:52,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:50:50" (2/3) ... [2019-09-08 03:50:52,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@192cbdc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:50:52, skipping insertion in model container [2019-09-08 03:50:52,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:50:52" (3/3) ... [2019-09-08 03:50:52,808 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec1_product21.cil.c [2019-09-08 03:50:52,820 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:50:52,830 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:50:52,851 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:50:52,910 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:50:52,911 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:50:52,911 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:50:52,911 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:50:52,912 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:50:52,912 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:50:52,912 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:50:52,912 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:50:52,912 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:50:52,959 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states. [2019-09-08 03:50:52,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 03:50:52,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:53,001 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:53,006 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:53,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:53,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1975081631, now seen corresponding path program 1 times [2019-09-08 03:50:53,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:53,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:53,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:53,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:53,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:53,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:50:53,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:53,683 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:53,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:54,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 3273 conjuncts, 1 conjunts are in the unsatisfiable core [2019-09-08 03:50:54,282 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:54,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:50:54,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:54,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-08 03:50:54,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:50:54,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:50:54,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:50:54,415 INFO L87 Difference]: Start difference. First operand 774 states. Second operand 4 states. [2019-09-08 03:50:54,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:54,612 INFO L93 Difference]: Finished difference Result 1232 states and 1991 transitions. [2019-09-08 03:50:54,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:50:54,614 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2019-09-08 03:50:54,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:54,649 INFO L225 Difference]: With dead ends: 1232 [2019-09-08 03:50:54,649 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:50:54,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:50:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:50:54,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:50:54,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:50:54,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 989 transitions. [2019-09-08 03:50:54,813 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 989 transitions. Word has length 155 [2019-09-08 03:50:54,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:54,814 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 989 transitions. [2019-09-08 03:50:54,814 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:50:54,815 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 989 transitions. [2019-09-08 03:50:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:50:54,834 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:54,835 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:54,835 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:54,836 INFO L82 PathProgramCache]: Analyzing trace with hash 511513774, now seen corresponding path program 1 times [2019-09-08 03:50:54,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:54,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:54,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:54,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:50:55,058 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:55,058 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:50:55,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:55,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 3278 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:50:55,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:55,700 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:50:55,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:55,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:50:55,714 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:50:55,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:50:55,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:50:55,715 INFO L87 Difference]: Start difference. First operand 620 states and 989 transitions. Second operand 6 states. [2019-09-08 03:50:55,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:55,829 INFO L93 Difference]: Finished difference Result 1212 states and 1951 transitions. [2019-09-08 03:50:55,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:50:55,830 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-09-08 03:50:55,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:55,835 INFO L225 Difference]: With dead ends: 1212 [2019-09-08 03:50:55,836 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:50:55,839 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:55,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:50:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:50:55,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:50:55,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 988 transitions. [2019-09-08 03:50:55,873 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 988 transitions. Word has length 159 [2019-09-08 03:50:55,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:55,873 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 988 transitions. [2019-09-08 03:50:55,873 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:50:55,873 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 988 transitions. [2019-09-08 03:50:55,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 03:50:55,880 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:55,880 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:55,881 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:55,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:55,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1781427860, now seen corresponding path program 1 times [2019-09-08 03:50:55,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:55,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:55,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:55,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:55,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:56,100 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:50:56,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:56,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:56,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:56,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:56,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 3280 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:50:56,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:56,673 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:50:56,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:56,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:50:56,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:50:56,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:50:56,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:50:56,684 INFO L87 Difference]: Start difference. First operand 620 states and 988 transitions. Second operand 6 states. [2019-09-08 03:50:56,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:56,781 INFO L93 Difference]: Finished difference Result 1216 states and 1954 transitions. [2019-09-08 03:50:56,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:50:56,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-09-08 03:50:56,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:56,792 INFO L225 Difference]: With dead ends: 1216 [2019-09-08 03:50:56,793 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:50:56,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:50:56,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:50:56,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:50:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:50:56,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 993 transitions. [2019-09-08 03:50:56,856 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 993 transitions. Word has length 161 [2019-09-08 03:50:56,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:56,857 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 993 transitions. [2019-09-08 03:50:56,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:50:56,857 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 993 transitions. [2019-09-08 03:50:56,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 03:50:56,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:56,865 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:56,865 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:56,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:56,866 INFO L82 PathProgramCache]: Analyzing trace with hash -831391142, now seen corresponding path program 1 times [2019-09-08 03:50:56,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:56,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:56,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:56,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:57,090 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:50:57,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:57,090 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:50:57,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:57,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:57,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 3281 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:50:57,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:50:57,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:57,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:50:57,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:50:57,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:50:57,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:50:57,662 INFO L87 Difference]: Start difference. First operand 626 states and 993 transitions. Second operand 6 states. [2019-09-08 03:50:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:57,749 INFO L93 Difference]: Finished difference Result 1215 states and 1945 transitions. [2019-09-08 03:50:57,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:50:57,750 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 162 [2019-09-08 03:50:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:57,755 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 03:50:57,755 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:50:57,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:57,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:50:57,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:50:57,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:50:57,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 992 transitions. [2019-09-08 03:50:57,788 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 992 transitions. Word has length 162 [2019-09-08 03:50:57,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:57,788 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 992 transitions. [2019-09-08 03:50:57,788 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:50:57,788 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 992 transitions. [2019-09-08 03:50:57,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-09-08 03:50:57,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:57,794 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:57,794 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:57,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:57,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1680400040, now seen corresponding path program 1 times [2019-09-08 03:50:57,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:57,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:57,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:57,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:57,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-08 03:50:57,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:57,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:50:57,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:58,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 3282 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:50:58,466 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:58,505 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:50:58,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:58,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:50:58,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:50:58,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:50:58,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:50:58,524 INFO L87 Difference]: Start difference. First operand 626 states and 992 transitions. Second operand 6 states. [2019-09-08 03:50:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:58,608 INFO L93 Difference]: Finished difference Result 1215 states and 1944 transitions. [2019-09-08 03:50:58,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:50:58,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 163 [2019-09-08 03:50:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:58,614 INFO L225 Difference]: With dead ends: 1215 [2019-09-08 03:50:58,614 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:50:58,617 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:50:58,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:50:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:50:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:50:58,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 991 transitions. [2019-09-08 03:50:58,639 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 991 transitions. Word has length 163 [2019-09-08 03:50:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:58,640 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 991 transitions. [2019-09-08 03:50:58,640 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:50:58,640 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 991 transitions. [2019-09-08 03:50:58,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 03:50:58,645 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:58,645 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:58,646 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:58,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:58,646 INFO L82 PathProgramCache]: Analyzing trace with hash 1066972054, now seen corresponding path program 1 times [2019-09-08 03:50:58,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:58,646 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:58,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:58,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:58,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:58,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:58,862 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:50:58,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:50:58,863 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:50:58,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:50:59,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:50:59,361 INFO L256 TraceCheckSpWp]: Trace formula consists of 3283 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-08 03:50:59,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:50:59,484 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:50:59,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:50:59,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 15 [2019-09-08 03:50:59,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 03:50:59,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 03:50:59,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:50:59,507 INFO L87 Difference]: Start difference. First operand 626 states and 991 transitions. Second operand 15 states. [2019-09-08 03:50:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:50:59,755 INFO L93 Difference]: Finished difference Result 1220 states and 1951 transitions. [2019-09-08 03:50:59,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:50:59,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2019-09-08 03:50:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:50:59,767 INFO L225 Difference]: With dead ends: 1220 [2019-09-08 03:50:59,768 INFO L226 Difference]: Without dead ends: 635 [2019-09-08 03:50:59,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 163 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-09-08 03:50:59,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-09-08 03:50:59,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 633. [2019-09-08 03:50:59,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:50:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1001 transitions. [2019-09-08 03:50:59,816 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1001 transitions. Word has length 164 [2019-09-08 03:50:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:50:59,816 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 1001 transitions. [2019-09-08 03:50:59,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 03:50:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1001 transitions. [2019-09-08 03:50:59,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-09-08 03:50:59,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:50:59,822 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:50:59,823 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:50:59,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:50:59,823 INFO L82 PathProgramCache]: Analyzing trace with hash -146369345, now seen corresponding path program 1 times [2019-09-08 03:50:59,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:50:59,824 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:50:59,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:59,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:50:59,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:50:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:51:00,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:00,012 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:00,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:00,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 3284 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:51:00,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:00,550 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:51:00,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:00,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:51:00,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:51:00,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:51:00,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:51:00,571 INFO L87 Difference]: Start difference. First operand 633 states and 1001 transitions. Second operand 8 states. [2019-09-08 03:51:00,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:00,875 INFO L93 Difference]: Finished difference Result 1227 states and 1964 transitions. [2019-09-08 03:51:00,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:51:00,876 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 165 [2019-09-08 03:51:00,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:00,882 INFO L225 Difference]: With dead ends: 1227 [2019-09-08 03:51:00,883 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:51:00,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:51:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:51:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-08 03:51:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:51:00,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 996 transitions. [2019-09-08 03:51:00,914 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 996 transitions. Word has length 165 [2019-09-08 03:51:00,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:00,915 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 996 transitions. [2019-09-08 03:51:00,915 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:51:00,915 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 996 transitions. [2019-09-08 03:51:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 03:51:00,920 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:00,920 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:00,921 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:00,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:00,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1928834139, now seen corresponding path program 1 times [2019-09-08 03:51:00,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:00,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:00,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:00,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:00,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 03:51:01,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:01,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:01,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:01,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 3284 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:51:01,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:51:01,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:01,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2019-09-08 03:51:01,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:01,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:01,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:01,580 INFO L87 Difference]: Start difference. First operand 633 states and 996 transitions. Second operand 6 states. [2019-09-08 03:51:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:01,851 INFO L93 Difference]: Finished difference Result 1227 states and 1952 transitions. [2019-09-08 03:51:01,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:51:01,852 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-09-08 03:51:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:01,859 INFO L225 Difference]: With dead ends: 1227 [2019-09-08 03:51:01,859 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 03:51:01,863 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:51:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 03:51:01,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 629. [2019-09-08 03:51:01,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2019-09-08 03:51:01,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 984 transitions. [2019-09-08 03:51:01,891 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 984 transitions. Word has length 166 [2019-09-08 03:51:01,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:01,892 INFO L475 AbstractCegarLoop]: Abstraction has 629 states and 984 transitions. [2019-09-08 03:51:01,892 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 984 transitions. [2019-09-08 03:51:01,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 03:51:01,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:01,897 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:01,897 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:01,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:01,897 INFO L82 PathProgramCache]: Analyzing trace with hash 241086921, now seen corresponding path program 1 times [2019-09-08 03:51:01,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:01,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:01,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:01,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:01,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:02,042 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:51:02,045 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:02,045 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:02,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:02,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:02,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 3288 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:51:02,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:51:02,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:02,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:51:02,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:51:02,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:51:02,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:51:02,567 INFO L87 Difference]: Start difference. First operand 629 states and 984 transitions. Second operand 8 states. [2019-09-08 03:51:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:02,889 INFO L93 Difference]: Finished difference Result 1244 states and 1966 transitions. [2019-09-08 03:51:02,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:51:02,890 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 169 [2019-09-08 03:51:02,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:02,896 INFO L225 Difference]: With dead ends: 1244 [2019-09-08 03:51:02,897 INFO L226 Difference]: Without dead ends: 647 [2019-09-08 03:51:02,900 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:51:02,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2019-09-08 03:51:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 644. [2019-09-08 03:51:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-08 03:51:02,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 997 transitions. [2019-09-08 03:51:02,937 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 997 transitions. Word has length 169 [2019-09-08 03:51:02,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:02,938 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 997 transitions. [2019-09-08 03:51:02,938 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:51:02,938 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 997 transitions. [2019-09-08 03:51:02,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 03:51:02,949 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:02,950 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:02,950 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:02,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:02,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1962806857, now seen corresponding path program 1 times [2019-09-08 03:51:02,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:02,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:02,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:02,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:02,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 03:51:03,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:03,106 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:51:03,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:03,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 3284 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-08 03:51:03,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:03,768 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:51:03,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:03,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [7] total 14 [2019-09-08 03:51:03,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:51:03,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:51:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:51:03,781 INFO L87 Difference]: Start difference. First operand 644 states and 997 transitions. Second operand 14 states. [2019-09-08 03:51:04,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:04,108 INFO L93 Difference]: Finished difference Result 1234 states and 1931 transitions. [2019-09-08 03:51:04,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:51:04,109 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 169 [2019-09-08 03:51:04,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:04,114 INFO L225 Difference]: With dead ends: 1234 [2019-09-08 03:51:04,114 INFO L226 Difference]: Without dead ends: 638 [2019-09-08 03:51:04,118 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:51:04,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-09-08 03:51:04,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 633. [2019-09-08 03:51:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:51:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 977 transitions. [2019-09-08 03:51:04,138 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 977 transitions. Word has length 169 [2019-09-08 03:51:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:04,139 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 977 transitions. [2019-09-08 03:51:04,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:51:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 977 transitions. [2019-09-08 03:51:04,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 03:51:04,144 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:04,144 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:04,144 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:04,145 INFO L82 PathProgramCache]: Analyzing trace with hash 156761498, now seen corresponding path program 1 times [2019-09-08 03:51:04,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:04,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:04,146 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:04,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:51:04,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:04,283 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:04,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:04,783 INFO L256 TraceCheckSpWp]: Trace formula consists of 3291 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:51:04,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:04,824 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (12)] Exception during sending of exit command (exit): Stream closed [2019-09-08 03:51:04,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:04,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:51:04,841 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:51:04,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:51:04,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:51:04,842 INFO L87 Difference]: Start difference. First operand 633 states and 977 transitions. Second operand 8 states. [2019-09-08 03:51:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:05,030 INFO L93 Difference]: Finished difference Result 1216 states and 1900 transitions. [2019-09-08 03:51:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:51:05,031 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 172 [2019-09-08 03:51:05,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:05,036 INFO L225 Difference]: With dead ends: 1216 [2019-09-08 03:51:05,036 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:51:05,040 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:51:05,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:51:05,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-08 03:51:05,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:51:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 976 transitions. [2019-09-08 03:51:05,069 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 976 transitions. Word has length 172 [2019-09-08 03:51:05,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:05,070 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 976 transitions. [2019-09-08 03:51:05,070 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:51:05,070 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 976 transitions. [2019-09-08 03:51:05,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 03:51:05,076 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:05,077 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:05,077 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:05,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:05,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1153991963, now seen corresponding path program 1 times [2019-09-08 03:51:05,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:05,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:05,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:05,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:05,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:05,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:05,283 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:51:05,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:05,284 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:51:05,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:05,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 3292 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:51:05,742 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:05,775 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 03:51:05,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:05,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-09-08 03:51:05,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:51:05,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:51:05,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:51:05,790 INFO L87 Difference]: Start difference. First operand 633 states and 976 transitions. Second operand 8 states. [2019-09-08 03:51:05,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:05,975 INFO L93 Difference]: Finished difference Result 1216 states and 1899 transitions. [2019-09-08 03:51:05,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:51:05,975 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 173 [2019-09-08 03:51:05,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:05,980 INFO L225 Difference]: With dead ends: 1216 [2019-09-08 03:51:05,980 INFO L226 Difference]: Without dead ends: 633 [2019-09-08 03:51:05,983 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:51:05,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2019-09-08 03:51:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 633. [2019-09-08 03:51:05,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-09-08 03:51:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 975 transitions. [2019-09-08 03:51:06,002 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 975 transitions. Word has length 173 [2019-09-08 03:51:06,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:06,003 INFO L475 AbstractCegarLoop]: Abstraction has 633 states and 975 transitions. [2019-09-08 03:51:06,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:51:06,003 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 975 transitions. [2019-09-08 03:51:06,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 03:51:06,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:06,008 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:06,008 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:06,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1543315839, now seen corresponding path program 1 times [2019-09-08 03:51:06,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:06,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:06,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:06,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:06,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:06,331 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-08 03:51:06,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:51:06,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:51:06,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:51:06,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:06,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 3293 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 03:51:06,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:51:06,942 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (14)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:51:06,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:51:06,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [14] total 18 [2019-09-08 03:51:06,961 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 03:51:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 03:51:06,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=271, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:51:06,964 INFO L87 Difference]: Start difference. First operand 633 states and 975 transitions. Second operand 18 states. [2019-09-08 03:51:07,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:07,569 INFO L93 Difference]: Finished difference Result 1232 states and 1926 transitions. [2019-09-08 03:51:07,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 03:51:07,570 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 174 [2019-09-08 03:51:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:07,576 INFO L225 Difference]: With dead ends: 1232 [2019-09-08 03:51:07,576 INFO L226 Difference]: Without dead ends: 648 [2019-09-08 03:51:07,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2019-09-08 03:51:07,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2019-09-08 03:51:07,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 644. [2019-09-08 03:51:07,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 644 states. [2019-09-08 03:51:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 983 transitions. [2019-09-08 03:51:07,601 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 983 transitions. Word has length 174 [2019-09-08 03:51:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:07,602 INFO L475 AbstractCegarLoop]: Abstraction has 644 states and 983 transitions. [2019-09-08 03:51:07,602 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 03:51:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 983 transitions. [2019-09-08 03:51:07,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:51:07,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:07,607 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:07,607 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:07,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:07,608 INFO L82 PathProgramCache]: Analyzing trace with hash 624972376, now seen corresponding path program 1 times [2019-09-08 03:51:07,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:07,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:07,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:07,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:07,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:07,754 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-08 03:51:07,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:07,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:51:07,755 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:51:07,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:51:07,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:51:07,756 INFO L87 Difference]: Start difference. First operand 644 states and 983 transitions. Second operand 9 states. [2019-09-08 03:51:07,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:07,983 INFO L93 Difference]: Finished difference Result 1163 states and 1822 transitions. [2019-09-08 03:51:07,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:51:07,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 175 [2019-09-08 03:51:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:07,989 INFO L225 Difference]: With dead ends: 1163 [2019-09-08 03:51:07,989 INFO L226 Difference]: Without dead ends: 641 [2019-09-08 03:51:07,993 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:51:07,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2019-09-08 03:51:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 641. [2019-09-08 03:51:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-09-08 03:51:08,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 978 transitions. [2019-09-08 03:51:08,035 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 978 transitions. Word has length 175 [2019-09-08 03:51:08,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:08,036 INFO L475 AbstractCegarLoop]: Abstraction has 641 states and 978 transitions. [2019-09-08 03:51:08,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:51:08,036 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 978 transitions. [2019-09-08 03:51:08,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 03:51:08,042 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:08,042 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:08,042 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:08,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:08,043 INFO L82 PathProgramCache]: Analyzing trace with hash 699664653, now seen corresponding path program 1 times [2019-09-08 03:51:08,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:08,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:08,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:08,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:08,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:08,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:08,243 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 03:51:08,244 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:08,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:51:08,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:51:08,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:51:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:51:08,246 INFO L87 Difference]: Start difference. First operand 641 states and 978 transitions. Second operand 7 states. [2019-09-08 03:51:08,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:08,338 INFO L93 Difference]: Finished difference Result 1160 states and 1817 transitions. [2019-09-08 03:51:08,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:51:08,339 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 176 [2019-09-08 03:51:08,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:08,344 INFO L225 Difference]: With dead ends: 1160 [2019-09-08 03:51:08,344 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:51:08,350 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:51:08,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:51:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 618. [2019-09-08 03:51:08,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:51:08,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 948 transitions. [2019-09-08 03:51:08,373 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 948 transitions. Word has length 176 [2019-09-08 03:51:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:08,374 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 948 transitions. [2019-09-08 03:51:08,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:51:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 948 transitions. [2019-09-08 03:51:08,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 03:51:08,379 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:08,381 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:08,381 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:08,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:08,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1123374031, now seen corresponding path program 1 times [2019-09-08 03:51:08,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:08,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:08,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:08,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:08,649 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 03:51:08,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:08,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:51:08,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:51:08,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:51:08,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:51:08,651 INFO L87 Difference]: Start difference. First operand 618 states and 948 transitions. Second operand 13 states. [2019-09-08 03:51:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:08,985 INFO L93 Difference]: Finished difference Result 1138 states and 1785 transitions. [2019-09-08 03:51:08,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:51:08,985 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 176 [2019-09-08 03:51:08,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:08,990 INFO L225 Difference]: With dead ends: 1138 [2019-09-08 03:51:08,990 INFO L226 Difference]: Without dead ends: 611 [2019-09-08 03:51:08,994 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:51:08,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-09-08 03:51:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-09-08 03:51:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-09-08 03:51:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 939 transitions. [2019-09-08 03:51:09,018 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 939 transitions. Word has length 176 [2019-09-08 03:51:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:09,020 INFO L475 AbstractCegarLoop]: Abstraction has 611 states and 939 transitions. [2019-09-08 03:51:09,020 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:51:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 939 transitions. [2019-09-08 03:51:09,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-08 03:51:09,025 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:09,026 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:09,026 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:09,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:09,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1912182484, now seen corresponding path program 1 times [2019-09-08 03:51:09,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:09,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:09,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:09,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:09,278 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 03:51:09,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:09,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 03:51:09,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:51:09,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:51:09,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:51:09,283 INFO L87 Difference]: Start difference. First operand 611 states and 939 transitions. Second operand 13 states. [2019-09-08 03:51:09,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:09,656 INFO L93 Difference]: Finished difference Result 1189 states and 1853 transitions. [2019-09-08 03:51:09,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:51:09,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 177 [2019-09-08 03:51:09,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:09,662 INFO L225 Difference]: With dead ends: 1189 [2019-09-08 03:51:09,662 INFO L226 Difference]: Without dead ends: 625 [2019-09-08 03:51:09,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:51:09,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2019-09-08 03:51:09,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 623. [2019-09-08 03:51:09,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 03:51:09,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 954 transitions. [2019-09-08 03:51:09,685 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 954 transitions. Word has length 177 [2019-09-08 03:51:09,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:09,686 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 954 transitions. [2019-09-08 03:51:09,686 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:51:09,686 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 954 transitions. [2019-09-08 03:51:09,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 03:51:09,691 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:09,691 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:09,691 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:09,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:09,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1185903340, now seen corresponding path program 1 times [2019-09-08 03:51:09,692 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:09,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:09,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:09,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:09,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:09,915 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:51:09,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:09,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:51:09,916 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:51:09,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:51:09,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:51:09,917 INFO L87 Difference]: Start difference. First operand 623 states and 954 transitions. Second operand 11 states. [2019-09-08 03:51:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:10,176 INFO L93 Difference]: Finished difference Result 1143 states and 1791 transitions. [2019-09-08 03:51:10,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:51:10,177 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 178 [2019-09-08 03:51:10,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:10,183 INFO L225 Difference]: With dead ends: 1143 [2019-09-08 03:51:10,184 INFO L226 Difference]: Without dead ends: 623 [2019-09-08 03:51:10,187 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:51:10,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2019-09-08 03:51:10,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 623. [2019-09-08 03:51:10,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-09-08 03:51:10,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 953 transitions. [2019-09-08 03:51:10,222 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 953 transitions. Word has length 178 [2019-09-08 03:51:10,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:10,225 INFO L475 AbstractCegarLoop]: Abstraction has 623 states and 953 transitions. [2019-09-08 03:51:10,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:51:10,225 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 953 transitions. [2019-09-08 03:51:10,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 03:51:10,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:10,233 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:10,234 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:10,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:10,234 INFO L82 PathProgramCache]: Analyzing trace with hash -645412386, now seen corresponding path program 1 times [2019-09-08 03:51:10,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:10,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:10,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:10,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:10,447 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-09-08 03:51:10,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:10,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 03:51:10,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:51:10,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:51:10,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:51:10,450 INFO L87 Difference]: Start difference. First operand 623 states and 953 transitions. Second operand 11 states. [2019-09-08 03:51:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:10,693 INFO L93 Difference]: Finished difference Result 1189 states and 1844 transitions. [2019-09-08 03:51:10,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:51:10,694 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 179 [2019-09-08 03:51:10,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:10,701 INFO L225 Difference]: With dead ends: 1189 [2019-09-08 03:51:10,701 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 03:51:10,704 INFO L628 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-09-08 03:51:10,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 03:51:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 03:51:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 03:51:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 945 transitions. [2019-09-08 03:51:10,724 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 945 transitions. Word has length 179 [2019-09-08 03:51:10,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:10,727 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 945 transitions. [2019-09-08 03:51:10,727 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:51:10,727 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 945 transitions. [2019-09-08 03:51:10,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 03:51:10,732 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:10,732 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:10,732 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:10,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:10,733 INFO L82 PathProgramCache]: Analyzing trace with hash 962098353, now seen corresponding path program 1 times [2019-09-08 03:51:10,733 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:10,733 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:10,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:10,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:51:10,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:10,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:51:10,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:10,920 INFO L87 Difference]: Start difference. First operand 620 states and 945 transitions. Second operand 6 states. [2019-09-08 03:51:14,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:14,969 INFO L93 Difference]: Finished difference Result 1743 states and 2807 transitions. [2019-09-08 03:51:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:51:14,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 180 [2019-09-08 03:51:14,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:14,983 INFO L225 Difference]: With dead ends: 1743 [2019-09-08 03:51:14,984 INFO L226 Difference]: Without dead ends: 1232 [2019-09-08 03:51:14,989 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:51:14,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2019-09-08 03:51:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 1149. [2019-09-08 03:51:15,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-09-08 03:51:15,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1805 transitions. [2019-09-08 03:51:15,138 INFO L78 Accepts]: Start accepts. Automaton has 1149 states and 1805 transitions. Word has length 180 [2019-09-08 03:51:15,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:15,139 INFO L475 AbstractCegarLoop]: Abstraction has 1149 states and 1805 transitions. [2019-09-08 03:51:15,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1149 states and 1805 transitions. [2019-09-08 03:51:15,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 03:51:15,145 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:15,145 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:15,145 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:15,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:15,146 INFO L82 PathProgramCache]: Analyzing trace with hash -300726734, now seen corresponding path program 1 times [2019-09-08 03:51:15,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:15,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:15,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:15,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:15,296 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:51:15,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:15,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:51:15,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:15,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:15,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:15,298 INFO L87 Difference]: Start difference. First operand 1149 states and 1805 transitions. Second operand 6 states. [2019-09-08 03:51:19,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:19,211 INFO L93 Difference]: Finished difference Result 3545 states and 5819 transitions. [2019-09-08 03:51:19,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:51:19,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 181 [2019-09-08 03:51:19,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:19,231 INFO L225 Difference]: With dead ends: 3545 [2019-09-08 03:51:19,231 INFO L226 Difference]: Without dead ends: 2506 [2019-09-08 03:51:19,237 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:51:19,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-09-08 03:51:19,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2313. [2019-09-08 03:51:19,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-09-08 03:51:19,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3716 transitions. [2019-09-08 03:51:19,354 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3716 transitions. Word has length 181 [2019-09-08 03:51:19,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:19,355 INFO L475 AbstractCegarLoop]: Abstraction has 2313 states and 3716 transitions. [2019-09-08 03:51:19,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3716 transitions. [2019-09-08 03:51:19,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 03:51:19,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:19,361 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:19,361 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:19,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:19,361 INFO L82 PathProgramCache]: Analyzing trace with hash -555803691, now seen corresponding path program 1 times [2019-09-08 03:51:19,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:19,362 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:19,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:19,362 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:19,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:19,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:51:19,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:19,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:51:19,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:19,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:19,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:19,499 INFO L87 Difference]: Start difference. First operand 2313 states and 3716 transitions. Second operand 6 states. [2019-09-08 03:51:23,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:23,515 INFO L93 Difference]: Finished difference Result 7636 states and 12779 transitions. [2019-09-08 03:51:23,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:51:23,516 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 182 [2019-09-08 03:51:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:23,569 INFO L225 Difference]: With dead ends: 7636 [2019-09-08 03:51:23,569 INFO L226 Difference]: Without dead ends: 5435 [2019-09-08 03:51:23,586 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:51:23,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5435 states. [2019-09-08 03:51:23,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5435 to 4935. [2019-09-08 03:51:23,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4935 states. [2019-09-08 03:51:23,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4935 states to 4935 states and 8085 transitions. [2019-09-08 03:51:23,946 INFO L78 Accepts]: Start accepts. Automaton has 4935 states and 8085 transitions. Word has length 182 [2019-09-08 03:51:23,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:23,947 INFO L475 AbstractCegarLoop]: Abstraction has 4935 states and 8085 transitions. [2019-09-08 03:51:23,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:23,947 INFO L276 IsEmpty]: Start isEmpty. Operand 4935 states and 8085 transitions. [2019-09-08 03:51:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 03:51:23,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:23,952 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:23,952 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:23,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:23,953 INFO L82 PathProgramCache]: Analyzing trace with hash 364540310, now seen corresponding path program 1 times [2019-09-08 03:51:23,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:23,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:23,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:23,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:24,135 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:51:24,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:24,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:51:24,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:24,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:24,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:24,137 INFO L87 Difference]: Start difference. First operand 4935 states and 8085 transitions. Second operand 6 states. [2019-09-08 03:51:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:28,955 INFO L93 Difference]: Finished difference Result 17197 states and 29419 transitions. [2019-09-08 03:51:28,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:51:28,956 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 183 [2019-09-08 03:51:28,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:29,162 INFO L225 Difference]: With dead ends: 17197 [2019-09-08 03:51:29,163 INFO L226 Difference]: Without dead ends: 12378 [2019-09-08 03:51:29,225 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:51:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12378 states. [2019-09-08 03:51:31,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12378 to 11013. [2019-09-08 03:51:31,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11013 states. [2019-09-08 03:51:31,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11013 states to 11013 states and 18416 transitions. [2019-09-08 03:51:31,771 INFO L78 Accepts]: Start accepts. Automaton has 11013 states and 18416 transitions. Word has length 183 [2019-09-08 03:51:31,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:31,772 INFO L475 AbstractCegarLoop]: Abstraction has 11013 states and 18416 transitions. [2019-09-08 03:51:31,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 11013 states and 18416 transitions. [2019-09-08 03:51:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:51:31,780 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:31,781 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:31,781 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:31,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:31,782 INFO L82 PathProgramCache]: Analyzing trace with hash -931771655, now seen corresponding path program 1 times [2019-09-08 03:51:31,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:31,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:31,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:31,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:31,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:32,033 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:51:32,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:32,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:51:32,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:51:32,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:51:32,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:51:32,045 INFO L87 Difference]: Start difference. First operand 11013 states and 18416 transitions. Second operand 6 states. [2019-09-08 03:51:37,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:37,126 INFO L93 Difference]: Finished difference Result 40262 states and 70641 transitions. [2019-09-08 03:51:37,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:51:37,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 184 [2019-09-08 03:51:37,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:37,440 INFO L225 Difference]: With dead ends: 40262 [2019-09-08 03:51:37,440 INFO L226 Difference]: Without dead ends: 29373 [2019-09-08 03:51:37,528 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:51:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29373 states. [2019-09-08 03:51:39,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29373 to 25555. [2019-09-08 03:51:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25555 states. [2019-09-08 03:51:39,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25555 states to 25555 states and 43733 transitions. [2019-09-08 03:51:39,784 INFO L78 Accepts]: Start accepts. Automaton has 25555 states and 43733 transitions. Word has length 184 [2019-09-08 03:51:39,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:39,785 INFO L475 AbstractCegarLoop]: Abstraction has 25555 states and 43733 transitions. [2019-09-08 03:51:39,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:51:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 25555 states and 43733 transitions. [2019-09-08 03:51:39,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 03:51:39,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:39,793 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:39,793 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:39,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:39,794 INFO L82 PathProgramCache]: Analyzing trace with hash 201418938, now seen corresponding path program 1 times [2019-09-08 03:51:39,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:39,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:39,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:39,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:39,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:51:40,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:40,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:51:40,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:51:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:51:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:51:40,938 INFO L87 Difference]: Start difference. First operand 25555 states and 43733 transitions. Second operand 9 states. [2019-09-08 03:51:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:48,987 INFO L93 Difference]: Finished difference Result 82273 states and 141153 transitions. [2019-09-08 03:51:48,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:51:48,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 184 [2019-09-08 03:51:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:49,418 INFO L225 Difference]: With dead ends: 82273 [2019-09-08 03:51:49,419 INFO L226 Difference]: Without dead ends: 56858 [2019-09-08 03:51:49,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:51:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56858 states. [2019-09-08 03:51:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56858 to 56039. [2019-09-08 03:51:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56039 states. [2019-09-08 03:51:53,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56039 states to 56039 states and 95329 transitions. [2019-09-08 03:51:53,626 INFO L78 Accepts]: Start accepts. Automaton has 56039 states and 95329 transitions. Word has length 184 [2019-09-08 03:51:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:51:53,627 INFO L475 AbstractCegarLoop]: Abstraction has 56039 states and 95329 transitions. [2019-09-08 03:51:53,627 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:51:53,627 INFO L276 IsEmpty]: Start isEmpty. Operand 56039 states and 95329 transitions. [2019-09-08 03:51:53,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 03:51:53,634 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:51:53,634 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:51:53,634 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:51:53,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:51:53,635 INFO L82 PathProgramCache]: Analyzing trace with hash 923245333, now seen corresponding path program 1 times [2019-09-08 03:51:53,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:51:53,635 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:51:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:53,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:51:53,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:51:53,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:51:53,762 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:51:53,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:51:53,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:51:53,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:51:53,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:51:53,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:51:53,764 INFO L87 Difference]: Start difference. First operand 56039 states and 95329 transitions. Second operand 5 states. [2019-09-08 03:51:58,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:51:58,330 INFO L93 Difference]: Finished difference Result 112240 states and 190882 transitions. [2019-09-08 03:51:58,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:51:58,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 190 [2019-09-08 03:51:58,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:51:58,788 INFO L225 Difference]: With dead ends: 112240 [2019-09-08 03:51:58,788 INFO L226 Difference]: Without dead ends: 56341 [2019-09-08 03:51:59,034 INFO L628 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-09-08 03:51:59,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56341 states. [2019-09-08 03:52:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56341 to 56031. [2019-09-08 03:52:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56031 states. [2019-09-08 03:52:02,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56031 states to 56031 states and 95313 transitions. [2019-09-08 03:52:02,292 INFO L78 Accepts]: Start accepts. Automaton has 56031 states and 95313 transitions. Word has length 190 [2019-09-08 03:52:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:02,292 INFO L475 AbstractCegarLoop]: Abstraction has 56031 states and 95313 transitions. [2019-09-08 03:52:02,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:52:02,293 INFO L276 IsEmpty]: Start isEmpty. Operand 56031 states and 95313 transitions. [2019-09-08 03:52:02,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 03:52:02,301 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:02,301 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:02,301 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:02,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:02,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1715588691, now seen corresponding path program 1 times [2019-09-08 03:52:02,302 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:02,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:02,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:02,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:02,445 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:52:02,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:52:02,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:52:02,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:52:02,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:52:02,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:02,447 INFO L87 Difference]: Start difference. First operand 56031 states and 95313 transitions. Second operand 7 states. [2019-09-08 03:52:05,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:05,880 INFO L93 Difference]: Finished difference Result 113298 states and 192652 transitions. [2019-09-08 03:52:05,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:52:05,880 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 190 [2019-09-08 03:52:05,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:06,328 INFO L225 Difference]: With dead ends: 113298 [2019-09-08 03:52:06,329 INFO L226 Difference]: Without dead ends: 57407 [2019-09-08 03:52:06,574 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:06,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57407 states. [2019-09-08 03:52:11,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57407 to 56703. [2019-09-08 03:52:11,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56703 states. [2019-09-08 03:52:12,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56703 states to 56703 states and 96270 transitions. [2019-09-08 03:52:12,037 INFO L78 Accepts]: Start accepts. Automaton has 56703 states and 96270 transitions. Word has length 190 [2019-09-08 03:52:12,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:12,038 INFO L475 AbstractCegarLoop]: Abstraction has 56703 states and 96270 transitions. [2019-09-08 03:52:12,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:52:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 56703 states and 96270 transitions. [2019-09-08 03:52:12,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 03:52:12,047 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:12,047 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:12,048 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1287196528, now seen corresponding path program 1 times [2019-09-08 03:52:12,048 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:12,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:12,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:12,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:12,214 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:52:12,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:52:12,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:52:12,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:52:12,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:52:12,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:12,216 INFO L87 Difference]: Start difference. First operand 56703 states and 96270 transitions. Second operand 7 states. [2019-09-08 03:52:15,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:15,204 INFO L93 Difference]: Finished difference Result 114450 states and 194185 transitions. [2019-09-08 03:52:15,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:52:15,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 189 [2019-09-08 03:52:15,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:15,618 INFO L225 Difference]: With dead ends: 114450 [2019-09-08 03:52:15,619 INFO L226 Difference]: Without dead ends: 57887 [2019-09-08 03:52:15,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:15,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57887 states. [2019-09-08 03:52:20,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57887 to 56799. [2019-09-08 03:52:20,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56799 states. [2019-09-08 03:52:21,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56799 states to 56799 states and 96366 transitions. [2019-09-08 03:52:21,450 INFO L78 Accepts]: Start accepts. Automaton has 56799 states and 96366 transitions. Word has length 189 [2019-09-08 03:52:21,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:21,451 INFO L475 AbstractCegarLoop]: Abstraction has 56799 states and 96366 transitions. [2019-09-08 03:52:21,451 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:52:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 56799 states and 96366 transitions. [2019-09-08 03:52:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 03:52:21,457 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:21,457 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:21,457 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:21,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash -1841226472, now seen corresponding path program 1 times [2019-09-08 03:52:21,458 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:21,458 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:21,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:21,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:21,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:21,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:21,672 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:52:21,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:52:21,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:52:21,673 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:52:21,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:52:21,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:52:21,673 INFO L87 Difference]: Start difference. First operand 56799 states and 96366 transitions. Second operand 8 states. [2019-09-08 03:52:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:33,355 INFO L93 Difference]: Finished difference Result 190851 states and 328034 transitions. [2019-09-08 03:52:33,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:52:33,356 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 199 [2019-09-08 03:52:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:34,144 INFO L225 Difference]: With dead ends: 190851 [2019-09-08 03:52:34,144 INFO L226 Difference]: Without dead ends: 134192 [2019-09-08 03:52:34,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:52:34,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134192 states. [2019-09-08 03:52:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134192 to 134062. [2019-09-08 03:52:41,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134062 states. [2019-09-08 03:52:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134062 states to 134062 states and 228522 transitions. [2019-09-08 03:52:42,149 INFO L78 Accepts]: Start accepts. Automaton has 134062 states and 228522 transitions. Word has length 199 [2019-09-08 03:52:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:52:42,150 INFO L475 AbstractCegarLoop]: Abstraction has 134062 states and 228522 transitions. [2019-09-08 03:52:42,150 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 03:52:42,150 INFO L276 IsEmpty]: Start isEmpty. Operand 134062 states and 228522 transitions. [2019-09-08 03:52:42,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-09-08 03:52:42,157 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:52:42,157 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:52:42,157 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:52:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:52:42,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1965669587, now seen corresponding path program 1 times [2019-09-08 03:52:42,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:52:42,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:52:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:42,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:52:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:52:42,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:52:42,313 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:52:42,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:52:42,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:52:42,316 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:52:42,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:52:42,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:52:42,317 INFO L87 Difference]: Start difference. First operand 134062 states and 228522 transitions. Second operand 7 states. [2019-09-08 03:52:53,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:52:53,686 INFO L93 Difference]: Finished difference Result 268815 states and 463967 transitions. [2019-09-08 03:52:53,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:52:53,687 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 201 [2019-09-08 03:52:53,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:52:54,712 INFO L225 Difference]: With dead ends: 268815 [2019-09-08 03:52:54,712 INFO L226 Difference]: Without dead ends: 134830 [2019-09-08 03:52:55,166 INFO L628 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-09-08 03:52:55,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134830 states. [2019-09-08 03:53:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134830 to 134830. [2019-09-08 03:53:05,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134830 states. [2019-09-08 03:53:06,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134830 states to 134830 states and 229226 transitions. [2019-09-08 03:53:06,720 INFO L78 Accepts]: Start accepts. Automaton has 134830 states and 229226 transitions. Word has length 201 [2019-09-08 03:53:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:06,720 INFO L475 AbstractCegarLoop]: Abstraction has 134830 states and 229226 transitions. [2019-09-08 03:53:06,721 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:53:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 134830 states and 229226 transitions. [2019-09-08 03:53:06,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2019-09-08 03:53:06,728 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:06,728 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:06,728 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:06,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:06,729 INFO L82 PathProgramCache]: Analyzing trace with hash -923747784, now seen corresponding path program 1 times [2019-09-08 03:53:06,729 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:06,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:06,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:06,730 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:06,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:53:07,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:07,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:53:07,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:53:07,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:53:07,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:53:07,745 INFO L87 Difference]: Start difference. First operand 134830 states and 229226 transitions. Second operand 7 states. [2019-09-08 03:53:24,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:24,745 INFO L93 Difference]: Finished difference Result 251182 states and 427995 transitions. [2019-09-08 03:53:24,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:53:24,746 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 202 [2019-09-08 03:53:24,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:25,549 INFO L225 Difference]: With dead ends: 251182 [2019-09-08 03:53:25,549 INFO L226 Difference]: Without dead ends: 140097 [2019-09-08 03:53:25,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 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-09-08 03:53:25,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140097 states. [2019-09-08 03:53:32,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140097 to 138542. [2019-09-08 03:53:32,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138542 states. [2019-09-08 03:53:33,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138542 states to 138542 states and 234281 transitions. [2019-09-08 03:53:33,694 INFO L78 Accepts]: Start accepts. Automaton has 138542 states and 234281 transitions. Word has length 202 [2019-09-08 03:53:33,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:53:33,695 INFO L475 AbstractCegarLoop]: Abstraction has 138542 states and 234281 transitions. [2019-09-08 03:53:33,695 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:53:33,695 INFO L276 IsEmpty]: Start isEmpty. Operand 138542 states and 234281 transitions. [2019-09-08 03:53:33,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 03:53:33,700 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:53:33,700 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:53:33,701 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:53:33,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:53:33,701 INFO L82 PathProgramCache]: Analyzing trace with hash 589808930, now seen corresponding path program 1 times [2019-09-08 03:53:33,701 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:53:33,701 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:53:33,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:33,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:53:33,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:53:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:53:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:53:33,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:53:33,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:53:33,848 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:53:33,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:53:33,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:53:33,849 INFO L87 Difference]: Start difference. First operand 138542 states and 234281 transitions. Second operand 6 states. [2019-09-08 03:53:45,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:53:45,608 INFO L93 Difference]: Finished difference Result 290508 states and 491498 transitions. [2019-09-08 03:53:45,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:53:45,609 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 206 [2019-09-08 03:53:45,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:53:46,993 INFO L225 Difference]: With dead ends: 290508 [2019-09-08 03:53:46,993 INFO L226 Difference]: Without dead ends: 175711 [2019-09-08 03:53:47,323 INFO L628 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-09-08 03:53:47,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175711 states. [2019-09-08 03:54:01,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175711 to 167513. [2019-09-08 03:54:01,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167513 states. [2019-09-08 03:54:03,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167513 states to 167513 states and 283230 transitions. [2019-09-08 03:54:03,903 INFO L78 Accepts]: Start accepts. Automaton has 167513 states and 283230 transitions. Word has length 206 [2019-09-08 03:54:03,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:03,904 INFO L475 AbstractCegarLoop]: Abstraction has 167513 states and 283230 transitions. [2019-09-08 03:54:03,904 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:54:03,904 INFO L276 IsEmpty]: Start isEmpty. Operand 167513 states and 283230 transitions. [2019-09-08 03:54:03,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-09-08 03:54:03,909 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:03,909 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:03,909 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:03,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:03,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1291408804, now seen corresponding path program 1 times [2019-09-08 03:54:03,910 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:03,910 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:03,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:03,911 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:03,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:04,082 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:54:04,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:04,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:54:04,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:54:04,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:54:04,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:54:04,084 INFO L87 Difference]: Start difference. First operand 167513 states and 283230 transitions. Second operand 4 states. [2019-09-08 03:54:19,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:54:19,344 INFO L93 Difference]: Finished difference Result 334244 states and 574566 transitions. [2019-09-08 03:54:19,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:54:19,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 206 [2019-09-08 03:54:19,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:54:20,174 INFO L225 Difference]: With dead ends: 334244 [2019-09-08 03:54:20,174 INFO L226 Difference]: Without dead ends: 166840 [2019-09-08 03:54:20,632 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:54:20,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166840 states. [2019-09-08 03:54:30,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166840 to 166840. [2019-09-08 03:54:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166840 states. [2019-09-08 03:54:32,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166840 states to 166840 states and 281884 transitions. [2019-09-08 03:54:32,983 INFO L78 Accepts]: Start accepts. Automaton has 166840 states and 281884 transitions. Word has length 206 [2019-09-08 03:54:32,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:54:32,984 INFO L475 AbstractCegarLoop]: Abstraction has 166840 states and 281884 transitions. [2019-09-08 03:54:32,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:54:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 166840 states and 281884 transitions. [2019-09-08 03:54:32,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-08 03:54:32,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:54:32,991 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:54:32,991 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:54:32,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:54:32,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1378676698, now seen corresponding path program 1 times [2019-09-08 03:54:32,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:54:32,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:54:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:32,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:54:32,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:54:33,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:54:33,273 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 03:54:33,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:54:33,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:54:33,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:54:33,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:54:33,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:54:33,275 INFO L87 Difference]: Start difference. First operand 166840 states and 281884 transitions. Second operand 9 states. [2019-09-08 03:55:06,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:55:06,379 INFO L93 Difference]: Finished difference Result 539465 states and 928453 transitions. [2019-09-08 03:55:06,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 03:55:06,379 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 207 [2019-09-08 03:55:06,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:55:09,525 INFO L225 Difference]: With dead ends: 539465 [2019-09-08 03:55:09,525 INFO L226 Difference]: Without dead ends: 372734 [2019-09-08 03:55:10,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:55:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372734 states. [2019-09-08 03:55:47,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372734 to 354792. [2019-09-08 03:55:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354792 states. [2019-09-08 03:55:50,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354792 states to 354792 states and 610908 transitions. [2019-09-08 03:55:50,301 INFO L78 Accepts]: Start accepts. Automaton has 354792 states and 610908 transitions. Word has length 207 [2019-09-08 03:55:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:55:50,301 INFO L475 AbstractCegarLoop]: Abstraction has 354792 states and 610908 transitions. [2019-09-08 03:55:50,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:55:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 354792 states and 610908 transitions. [2019-09-08 03:55:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 03:55:50,306 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:55:50,306 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:55:50,306 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:55:50,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:55:50,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1982057674, now seen corresponding path program 1 times [2019-09-08 03:55:50,307 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:55:50,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:55:50,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:50,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:50,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:55:50,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 03:55:59,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:55:59,123 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:55:59,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:55:59,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:55:59,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 3369 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-08 03:55:59,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:55:59,711 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (15)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 03:55:59,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:55:59,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 14 [2019-09-08 03:55:59,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 03:55:59,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 03:55:59,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2019-09-08 03:55:59,722 INFO L87 Difference]: Start difference. First operand 354792 states and 610908 transitions. Second operand 14 states. [2019-09-08 03:56:45,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:56:45,529 INFO L93 Difference]: Finished difference Result 760607 states and 1329185 transitions. [2019-09-08 03:56:45,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 03:56:45,529 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 208 [2019-09-08 03:56:45,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:56:49,047 INFO L225 Difference]: With dead ends: 760607 [2019-09-08 03:56:49,047 INFO L226 Difference]: Without dead ends: 405924 [2019-09-08 03:56:50,929 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=466, Unknown=0, NotChecked=0, Total=552 [2019-09-08 03:56:51,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405924 states. [2019-09-08 03:57:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405924 to 385356. [2019-09-08 03:57:27,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385356 states. [2019-09-08 03:57:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385356 states to 385356 states and 667048 transitions. [2019-09-08 03:57:32,588 INFO L78 Accepts]: Start accepts. Automaton has 385356 states and 667048 transitions. Word has length 208 [2019-09-08 03:57:32,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:57:32,589 INFO L475 AbstractCegarLoop]: Abstraction has 385356 states and 667048 transitions. [2019-09-08 03:57:32,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 03:57:32,589 INFO L276 IsEmpty]: Start isEmpty. Operand 385356 states and 667048 transitions. [2019-09-08 03:57:32,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-09-08 03:57:32,594 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:57:32,595 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:57:32,595 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:57:32,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:57:32,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1301140338, now seen corresponding path program 1 times [2019-09-08 03:57:32,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:57:32,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:57:32,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:32,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:57:32,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:57:34,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:57:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:57:34,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:57:34,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:57:34,582 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:57:34,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:57:34,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:57:34,583 INFO L87 Difference]: Start difference. First operand 385356 states and 667048 transitions. Second operand 6 states. [2019-09-08 03:58:07,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:58:07,478 INFO L93 Difference]: Finished difference Result 385922 states and 669437 transitions. [2019-09-08 03:58:07,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:58:07,478 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 215 [2019-09-08 03:58:07,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:58:09,855 INFO L225 Difference]: With dead ends: 385922 [2019-09-08 03:58:09,856 INFO L226 Difference]: Without dead ends: 385906 [2019-09-08 03:58:10,072 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:58:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385906 states. [2019-09-08 03:58:50,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385906 to 385461. [2019-09-08 03:58:50,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385461 states. [2019-09-08 03:58:54,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385461 states to 385461 states and 667153 transitions. [2019-09-08 03:58:54,609 INFO L78 Accepts]: Start accepts. Automaton has 385461 states and 667153 transitions. Word has length 215 [2019-09-08 03:58:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:58:54,610 INFO L475 AbstractCegarLoop]: Abstraction has 385461 states and 667153 transitions. [2019-09-08 03:58:54,610 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:58:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 385461 states and 667153 transitions. [2019-09-08 03:58:54,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-09-08 03:58:54,619 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:58:54,619 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:58:54,619 INFO L418 AbstractCegarLoop]: === Iteration 37 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:58:54,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:58:54,620 INFO L82 PathProgramCache]: Analyzing trace with hash 745121134, now seen corresponding path program 1 times [2019-09-08 03:58:54,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:58:54,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:58:54,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:54,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:58:54,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:58:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:58:54,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 03:58:54,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:58:54,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 03:58:54,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 03:58:54,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 03:58:54,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 03:58:54,773 INFO L87 Difference]: Start difference. First operand 385461 states and 667153 transitions. Second operand 8 states. [2019-09-08 03:59:26,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:59:26,950 INFO L93 Difference]: Finished difference Result 385547 states and 667276 transitions. [2019-09-08 03:59:26,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:59:26,951 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 222 [2019-09-08 03:59:26,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:59:29,428 INFO L225 Difference]: With dead ends: 385547 [2019-09-08 03:59:29,429 INFO L226 Difference]: Without dead ends: 385531 [2019-09-08 03:59:29,664 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:59:30,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385531 states. [2019-09-08 04:00:07,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385531 to 385461. [2019-09-08 04:00:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385461 states. [2019-09-08 04:00:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385461 states to 385461 states and 666763 transitions. [2019-09-08 04:00:12,665 INFO L78 Accepts]: Start accepts. Automaton has 385461 states and 666763 transitions. Word has length 222 [2019-09-08 04:00:12,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:00:12,666 INFO L475 AbstractCegarLoop]: Abstraction has 385461 states and 666763 transitions. [2019-09-08 04:00:12,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:00:12,666 INFO L276 IsEmpty]: Start isEmpty. Operand 385461 states and 666763 transitions. [2019-09-08 04:00:12,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-09-08 04:00:12,675 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:00:12,676 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:00:12,676 INFO L418 AbstractCegarLoop]: === Iteration 38 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:00:12,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:00:12,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2040394586, now seen corresponding path program 1 times [2019-09-08 04:00:12,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:00:12,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:00:12,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:12,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:00:12,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:00:12,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:00:12,855 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-08 04:00:12,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:00:12,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:00:12,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:00:12,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:00:12,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:00:12,858 INFO L87 Difference]: Start difference. First operand 385461 states and 666763 transitions. Second operand 9 states. [2019-09-08 04:00:54,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:00:54,813 INFO L93 Difference]: Finished difference Result 771063 states and 1335509 transitions. [2019-09-08 04:00:54,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:00:54,813 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 240 [2019-09-08 04:00:54,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:00:57,321 INFO L225 Difference]: With dead ends: 771063 [2019-09-08 04:00:57,321 INFO L226 Difference]: Without dead ends: 385851 [2019-09-08 04:00:59,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:00:59,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385851 states.