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_spec9_product29.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:24:50,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:24:50,061 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:24:50,081 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:24:50,082 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:24:50,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:24:50,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:24:50,099 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:24:50,102 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:24:50,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:24:50,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:24:50,108 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:24:50,108 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:24:50,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:24:50,110 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:24:50,111 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:24:50,112 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:24:50,113 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:24:50,115 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:24:50,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:24:50,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:24:50,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:24:50,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:24:50,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:24:50,123 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:24:50,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:24:50,124 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:24:50,125 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:24:50,125 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:24:50,126 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:24:50,126 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:24:50,127 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:24:50,128 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:24:50,129 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:24:50,130 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:24:50,130 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:24:50,131 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:24:50,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:24:50,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:24:50,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:24:50,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:24:50,134 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 04:24:50,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:24:50,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:24:50,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:24:50,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:24:50,150 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:24:50,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:24:50,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:24:50,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:24:50,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:24:50,152 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:24:50,152 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:24:50,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:24:50,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:24:50,153 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:24:50,153 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:24:50,153 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:24:50,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:24:50,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:24:50,154 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:24:50,154 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:24:50,154 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:24:50,154 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:24:50,155 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:24:50,155 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:24:50,155 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:24:50,155 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:24:50,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:24:50,156 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:24:50,156 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:24:50,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:24:50,201 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:24:50,205 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:24:50,207 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:24:50,207 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:24:50,208 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-09-08 04:24:50,286 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd605d633/236976d52b43498abae79bba011e0f19/FLAGde5b7537f [2019-09-08 04:24:50,913 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:24:50,914 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product29.cil.c [2019-09-08 04:24:50,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd605d633/236976d52b43498abae79bba011e0f19/FLAGde5b7537f [2019-09-08 04:24:51,118 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dd605d633/236976d52b43498abae79bba011e0f19 [2019-09-08 04:24:51,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:24:51,137 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:24:51,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:24:51,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:24:51,144 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:24:51,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:24:51" (1/1) ... [2019-09-08 04:24:51,149 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2088cf83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:51, skipping insertion in model container [2019-09-08 04:24:51,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:24:51" (1/1) ... [2019-09-08 04:24:51,159 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:24:51,263 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:24:52,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:24:52,066 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:24:52,214 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:24:52,294 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:24:52,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52 WrapperNode [2019-09-08 04:24:52,295 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:24:52,296 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:24:52,296 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:24:52,296 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:24:52,306 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (1/1) ... [2019-09-08 04:24:52,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (1/1) ... [2019-09-08 04:24:52,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (1/1) ... [2019-09-08 04:24:52,341 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (1/1) ... [2019-09-08 04:24:52,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (1/1) ... [2019-09-08 04:24:52,437 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (1/1) ... [2019-09-08 04:24:52,449 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (1/1) ... [2019-09-08 04:24:52,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:24:52,467 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:24:52,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:24:52,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:24:52,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (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 04:24:52,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:24:52,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:24:52,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:24:52,584 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:24:52,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:24:52,585 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:24:52,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:24:52,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:24:52,586 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:24:52,586 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:24:52,587 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:24:52,587 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:24:52,587 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:24:52,588 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:24:52,588 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:24:52,589 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:24:52,591 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:24:52,591 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:24:52,591 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:24:52,591 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:24:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:24:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:24:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:24:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:24:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:24:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:24:52,592 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:24:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:24:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:24:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:24:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:24:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:24:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:24:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:24:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:24:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:24:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:24:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:24:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:24:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:24:52,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:24:52,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:24:52,595 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:24:52,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:24:52,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:24:52,596 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:24:52,596 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:24:52,596 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:24:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:24:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 04:24:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:24:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:24:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__weight [2019-09-08 04:24:52,597 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:24:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:24:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:24:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:24:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:24:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:24:52,598 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:24:52,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:24:52,599 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:24:52,599 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:24:52,599 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:24:52,599 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:24:52,600 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:24:52,600 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:24:52,600 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:24:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:24:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:24:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:24:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:24:52,602 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:24:52,602 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:24:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:24:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:24:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:24:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:24:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:24:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:24:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:24:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:24:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:24:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:24:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:24:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:24:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:24:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:24:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:24:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:24:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:24:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:24:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:24:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:24:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:24:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:24:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:24:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:24:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:24:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:24:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:24:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:24:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:24:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:24:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:24:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:24:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:24:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:24:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:24:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:24:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:24:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:24:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:24:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:24:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:24:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:24:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:24:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:24:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:24:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:24:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:24:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:24:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:24:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:24:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:24:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:24:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:24:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:24:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:24:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:24:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:24:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:24:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:24:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:24:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:24:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:24:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:24:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:24:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:24:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:24:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:24:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:24:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:24:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:24:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:24:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:24:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:24:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:24:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:24:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:24:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 04:24:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:24:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__weight [2019-09-08 04:24:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:24:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:24:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:24:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:24:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:24:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-09-08 04:24:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:24:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:24:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-09-08 04:24:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:24:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:24:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:24:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:24:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:24:52,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:24:52,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:24:55,069 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:24:55,069 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:24:55,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:24:55 BoogieIcfgContainer [2019-09-08 04:24:55,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:24:55,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:24:55,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:24:55,078 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:24:55,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:24:51" (1/3) ... [2019-09-08 04:24:55,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d6e23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:24:55, skipping insertion in model container [2019-09-08 04:24:55,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:24:52" (2/3) ... [2019-09-08 04:24:55,080 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d6e23d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:24:55, skipping insertion in model container [2019-09-08 04:24:55,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:24:55" (3/3) ... [2019-09-08 04:24:55,083 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product29.cil.c [2019-09-08 04:24:55,095 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:24:55,107 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:24:55,125 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:24:55,186 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:24:55,187 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:24:55,187 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:24:55,187 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:24:55,187 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:24:55,187 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:24:55,187 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:24:55,188 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:24:55,188 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:24:55,240 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states. [2019-09-08 04:24:55,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2019-09-08 04:24:55,282 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:55,283 INFO L399 BasicCegarLoop]: trace histogram [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 04:24:55,286 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:55,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 998764860, now seen corresponding path program 1 times [2019-09-08 04:24:55,294 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:55,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:55,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:55,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:55,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:55,876 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:55,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:55,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:55,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:55,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:55,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:55,901 INFO L87 Difference]: Start difference. First operand 780 states. Second operand 4 states. [2019-09-08 04:24:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:56,156 INFO L93 Difference]: Finished difference Result 1223 states and 1973 transitions. [2019-09-08 04:24:56,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:56,158 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 126 [2019-09-08 04:24:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:56,188 INFO L225 Difference]: With dead ends: 1223 [2019-09-08 04:24:56,189 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:56,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:24:56,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:56,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:56,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:56,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 988 transitions. [2019-09-08 04:24:56,312 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 988 transitions. Word has length 126 [2019-09-08 04:24:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:56,312 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 988 transitions. [2019-09-08 04:24:56,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:56,313 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 988 transitions. [2019-09-08 04:24:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 04:24:56,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:56,321 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:24:56,321 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:56,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1436115491, now seen corresponding path program 1 times [2019-09-08 04:24:56,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:56,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:56,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:56,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:56,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:56,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:56,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:56,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:56,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:56,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:56,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:56,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:56,505 INFO L87 Difference]: Start difference. First operand 620 states and 988 transitions. Second operand 4 states. [2019-09-08 04:24:56,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:56,591 INFO L93 Difference]: Finished difference Result 1203 states and 1934 transitions. [2019-09-08 04:24:56,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:56,592 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-08 04:24:56,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:56,599 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 04:24:56,599 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:56,604 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:24:56,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:56,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:56,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 987 transitions. [2019-09-08 04:24:56,652 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 987 transitions. Word has length 129 [2019-09-08 04:24:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:56,652 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 987 transitions. [2019-09-08 04:24:56,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 987 transitions. [2019-09-08 04:24:56,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 04:24:56,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:56,660 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:56,660 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:56,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:56,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1964351121, now seen corresponding path program 1 times [2019-09-08 04:24:56,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:56,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:56,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:56,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:56,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:56,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:56,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:56,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:56,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:56,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:56,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:56,825 INFO L87 Difference]: Start difference. First operand 620 states and 987 transitions. Second operand 4 states. [2019-09-08 04:24:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:56,940 INFO L93 Difference]: Finished difference Result 1203 states and 1933 transitions. [2019-09-08 04:24:56,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:56,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-08 04:24:56,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:56,947 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 04:24:56,948 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:56,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:24:56,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:56,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:56,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 986 transitions. [2019-09-08 04:24:56,986 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 986 transitions. Word has length 130 [2019-09-08 04:24:56,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:56,986 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 986 transitions. [2019-09-08 04:24:56,986 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:56,986 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 986 transitions. [2019-09-08 04:24:56,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 04:24:56,992 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:56,992 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:24:56,992 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:56,993 INFO L82 PathProgramCache]: Analyzing trace with hash 2042355745, now seen corresponding path program 1 times [2019-09-08 04:24:56,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:56,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:56,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:56,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:56,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:57,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:57,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:57,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:57,137 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:57,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:57,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:57,138 INFO L87 Difference]: Start difference. First operand 620 states and 986 transitions. Second operand 4 states. [2019-09-08 04:24:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:57,205 INFO L93 Difference]: Finished difference Result 1203 states and 1932 transitions. [2019-09-08 04:24:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:57,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2019-09-08 04:24:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:57,211 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 04:24:57,211 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:57,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:24:57,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:57,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:57,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:57,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 985 transitions. [2019-09-08 04:24:57,240 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 985 transitions. Word has length 131 [2019-09-08 04:24:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:57,240 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 985 transitions. [2019-09-08 04:24:57,240 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 985 transitions. [2019-09-08 04:24:57,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-08 04:24:57,245 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:57,246 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:24:57,246 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:57,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:57,246 INFO L82 PathProgramCache]: Analyzing trace with hash 603391923, now seen corresponding path program 1 times [2019-09-08 04:24:57,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:57,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:57,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:57,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:57,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:57,362 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:57,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:57,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:57,363 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:57,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:57,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:57,364 INFO L87 Difference]: Start difference. First operand 620 states and 985 transitions. Second operand 4 states. [2019-09-08 04:24:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:57,422 INFO L93 Difference]: Finished difference Result 1203 states and 1931 transitions. [2019-09-08 04:24:57,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:57,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 132 [2019-09-08 04:24:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:57,428 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 04:24:57,428 INFO L226 Difference]: Without dead ends: 620 [2019-09-08 04:24:57,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:24:57,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2019-09-08 04:24:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 620. [2019-09-08 04:24:57,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 620 states. [2019-09-08 04:24:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 984 transitions. [2019-09-08 04:24:57,455 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 984 transitions. Word has length 132 [2019-09-08 04:24:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:57,456 INFO L475 AbstractCegarLoop]: Abstraction has 620 states and 984 transitions. [2019-09-08 04:24:57,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 984 transitions. [2019-09-08 04:24:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 04:24:57,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:57,461 INFO L399 BasicCegarLoop]: trace histogram [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 04:24:57,461 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:57,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash 2147328613, now seen corresponding path program 1 times [2019-09-08 04:24:57,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:57,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:57,654 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:57,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:57,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:24:57,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:24:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:24:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:24:57,656 INFO L87 Difference]: Start difference. First operand 620 states and 984 transitions. Second operand 10 states. [2019-09-08 04:24:57,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:57,972 INFO L93 Difference]: Finished difference Result 1161 states and 1851 transitions. [2019-09-08 04:24:57,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:24:57,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2019-09-08 04:24:57,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:57,984 INFO L225 Difference]: With dead ends: 1161 [2019-09-08 04:24:57,986 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 04:24:57,991 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:24:57,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 04:24:58,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 627. [2019-09-08 04:24:58,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-09-08 04:24:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 993 transitions. [2019-09-08 04:24:58,023 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 993 transitions. Word has length 133 [2019-09-08 04:24:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:58,025 INFO L475 AbstractCegarLoop]: Abstraction has 627 states and 993 transitions. [2019-09-08 04:24:58,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:24:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 993 transitions. [2019-09-08 04:24:58,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 04:24:58,031 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:58,031 INFO L399 BasicCegarLoop]: trace histogram [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 04:24:58,032 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:58,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1347103130, now seen corresponding path program 1 times [2019-09-08 04:24:58,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:58,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:58,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:58,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:58,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:58,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:58,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:24:58,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:24:58,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:24:58,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:24:58,165 INFO L87 Difference]: Start difference. First operand 627 states and 993 transitions. Second operand 4 states. [2019-09-08 04:24:58,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:58,231 INFO L93 Difference]: Finished difference Result 1209 states and 1937 transitions. [2019-09-08 04:24:58,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:24:58,231 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-09-08 04:24:58,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:58,239 INFO L225 Difference]: With dead ends: 1209 [2019-09-08 04:24:58,239 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 04:24:58,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:24:58,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 04:24:58,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-08 04:24:58,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 04:24:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 970 transitions. [2019-09-08 04:24:58,270 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 970 transitions. Word has length 133 [2019-09-08 04:24:58,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:58,270 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 970 transitions. [2019-09-08 04:24:58,270 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:24:58,270 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 970 transitions. [2019-09-08 04:24:58,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 04:24:58,277 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:58,278 INFO L399 BasicCegarLoop]: trace histogram [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 04:24:58,278 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:58,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:58,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1290451205, now seen corresponding path program 1 times [2019-09-08 04:24:58,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:58,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:58,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:58,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:58,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:58,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:58,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:58,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:24:58,445 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:24:58,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:24:58,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:24:58,446 INFO L87 Difference]: Start difference. First operand 614 states and 970 transitions. Second operand 6 states. [2019-09-08 04:24:58,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:58,663 INFO L93 Difference]: Finished difference Result 1149 states and 1829 transitions. [2019-09-08 04:24:58,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:24:58,664 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-08 04:24:58,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:58,669 INFO L225 Difference]: With dead ends: 1149 [2019-09-08 04:24:58,670 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 04:24:58,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 04:24:58,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 04:24:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-08 04:24:58,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 04:24:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 966 transitions. [2019-09-08 04:24:58,707 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 966 transitions. Word has length 134 [2019-09-08 04:24:58,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:58,709 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 966 transitions. [2019-09-08 04:24:58,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:24:58,709 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 966 transitions. [2019-09-08 04:24:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 04:24:58,715 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:58,715 INFO L399 BasicCegarLoop]: trace histogram [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 04:24:58,716 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:58,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:58,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1379251042, now seen corresponding path program 1 times [2019-09-08 04:24:58,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:58,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:58,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:58,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:58,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:58,959 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:58,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:58,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:24:58,960 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:24:58,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:24:58,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:24:58,961 INFO L87 Difference]: Start difference. First operand 614 states and 966 transitions. Second operand 6 states. [2019-09-08 04:24:59,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:59,174 INFO L93 Difference]: Finished difference Result 1149 states and 1825 transitions. [2019-09-08 04:24:59,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:24:59,175 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 135 [2019-09-08 04:24:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:59,181 INFO L225 Difference]: With dead ends: 1149 [2019-09-08 04:24:59,181 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 04:24:59,185 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 04:24:59,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 04:24:59,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-08 04:24:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 04:24:59,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 962 transitions. [2019-09-08 04:24:59,217 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 962 transitions. Word has length 135 [2019-09-08 04:24:59,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:59,218 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 962 transitions. [2019-09-08 04:24:59,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:24:59,218 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 962 transitions. [2019-09-08 04:24:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 04:24:59,223 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:59,223 INFO L399 BasicCegarLoop]: trace histogram [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 04:24:59,223 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:59,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash 234769472, now seen corresponding path program 1 times [2019-09-08 04:24:59,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:59,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:59,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:59,226 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:59,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:59,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:59,383 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:59,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:24:59,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:24:59,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:24:59,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:24:59,384 INFO L87 Difference]: Start difference. First operand 614 states and 962 transitions. Second operand 6 states. [2019-09-08 04:24:59,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:59,578 INFO L93 Difference]: Finished difference Result 1149 states and 1821 transitions. [2019-09-08 04:24:59,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:24:59,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-08 04:24:59,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:59,585 INFO L225 Difference]: With dead ends: 1149 [2019-09-08 04:24:59,586 INFO L226 Difference]: Without dead ends: 614 [2019-09-08 04:24:59,589 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 04:24:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-09-08 04:24:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-09-08 04:24:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-09-08 04:24:59,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 958 transitions. [2019-09-08 04:24:59,612 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 958 transitions. Word has length 136 [2019-09-08 04:24:59,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:59,613 INFO L475 AbstractCegarLoop]: Abstraction has 614 states and 958 transitions. [2019-09-08 04:24:59,613 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:24:59,613 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 958 transitions. [2019-09-08 04:24:59,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 04:24:59,618 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:59,618 INFO L399 BasicCegarLoop]: trace histogram [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 04:24:59,619 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:59,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:59,619 INFO L82 PathProgramCache]: Analyzing trace with hash -185638976, now seen corresponding path program 1 times [2019-09-08 04:24:59,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:59,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:59,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:59,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:59,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:24:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:24:59,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:24:59,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:24:59,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:24:59,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:24:59,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:24:59,785 INFO L87 Difference]: Start difference. First operand 614 states and 958 transitions. Second operand 7 states. [2019-09-08 04:24:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:59,875 INFO L93 Difference]: Finished difference Result 1149 states and 1817 transitions. [2019-09-08 04:24:59,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:24:59,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 136 [2019-09-08 04:24:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:59,881 INFO L225 Difference]: With dead ends: 1149 [2019-09-08 04:24:59,882 INFO L226 Difference]: Without dead ends: 593 [2019-09-08 04:24:59,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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 04:24:59,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-08 04:24:59,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-09-08 04:24:59,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-08 04:24:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 924 transitions. [2019-09-08 04:24:59,909 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 924 transitions. Word has length 136 [2019-09-08 04:24:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:24:59,909 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 924 transitions. [2019-09-08 04:24:59,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:24:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 924 transitions. [2019-09-08 04:24:59,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 04:24:59,915 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:24:59,915 INFO L399 BasicCegarLoop]: trace histogram [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 04:24:59,915 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:24:59,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:24:59,916 INFO L82 PathProgramCache]: Analyzing trace with hash -486730051, now seen corresponding path program 1 times [2019-09-08 04:24:59,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:24:59,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:24:59,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:59,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:24:59,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:24:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:00,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:00,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:00,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:00,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:00,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:00,147 INFO L87 Difference]: Start difference. First operand 593 states and 924 transitions. Second operand 6 states. [2019-09-08 04:25:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:00,246 INFO L93 Difference]: Finished difference Result 1128 states and 1783 transitions. [2019-09-08 04:25:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:25:00,247 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2019-09-08 04:25:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:00,252 INFO L225 Difference]: With dead ends: 1128 [2019-09-08 04:25:00,252 INFO L226 Difference]: Without dead ends: 593 [2019-09-08 04:25:00,256 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 04:25:00,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-08 04:25:00,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-09-08 04:25:00,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-08 04:25:00,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 923 transitions. [2019-09-08 04:25:00,278 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 923 transitions. Word has length 137 [2019-09-08 04:25:00,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:00,278 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 923 transitions. [2019-09-08 04:25:00,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:00,278 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 923 transitions. [2019-09-08 04:25:00,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 04:25:00,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:00,284 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:25:00,284 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:00,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:00,284 INFO L82 PathProgramCache]: Analyzing trace with hash -980688005, now seen corresponding path program 1 times [2019-09-08 04:25:00,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:00,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:00,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:00,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:00,414 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:00,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:00,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:00,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:00,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:00,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:00,416 INFO L87 Difference]: Start difference. First operand 593 states and 923 transitions. Second operand 6 states. [2019-09-08 04:25:00,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:00,532 INFO L93 Difference]: Finished difference Result 1128 states and 1782 transitions. [2019-09-08 04:25:00,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:25:00,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 138 [2019-09-08 04:25:00,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:00,539 INFO L225 Difference]: With dead ends: 1128 [2019-09-08 04:25:00,539 INFO L226 Difference]: Without dead ends: 593 [2019-09-08 04:25:00,544 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 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 04:25:00,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-08 04:25:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-09-08 04:25:00,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-08 04:25:00,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 922 transitions. [2019-09-08 04:25:00,570 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 922 transitions. Word has length 138 [2019-09-08 04:25:00,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:00,570 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 922 transitions. [2019-09-08 04:25:00,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 922 transitions. [2019-09-08 04:25:00,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 04:25:00,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:00,577 INFO L399 BasicCegarLoop]: trace histogram [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 04:25:00,578 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:00,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:00,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1284175384, now seen corresponding path program 1 times [2019-09-08 04:25:00,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:00,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:00,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:00,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:00,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:00,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:00,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:00,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:25:00,782 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:25:00,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:25:00,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:25:00,783 INFO L87 Difference]: Start difference. First operand 593 states and 922 transitions. Second operand 12 states. [2019-09-08 04:25:00,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:00,954 INFO L93 Difference]: Finished difference Result 1129 states and 1781 transitions. [2019-09-08 04:25:00,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:25:00,955 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2019-09-08 04:25:00,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:00,960 INFO L225 Difference]: With dead ends: 1129 [2019-09-08 04:25:00,960 INFO L226 Difference]: Without dead ends: 593 [2019-09-08 04:25:00,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-09-08 04:25:00,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-09-08 04:25:00,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 593. [2019-09-08 04:25:00,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2019-09-08 04:25:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 921 transitions. [2019-09-08 04:25:00,983 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 921 transitions. Word has length 139 [2019-09-08 04:25:00,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:00,983 INFO L475 AbstractCegarLoop]: Abstraction has 593 states and 921 transitions. [2019-09-08 04:25:00,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:25:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 921 transitions. [2019-09-08 04:25:00,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 04:25:00,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:00,988 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:25:00,988 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:00,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:00,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1594513904, now seen corresponding path program 1 times [2019-09-08 04:25:00,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:00,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:00,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:00,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:00,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:01,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:01,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:01,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:01,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:01,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:01,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:01,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:01,168 INFO L87 Difference]: Start difference. First operand 593 states and 921 transitions. Second operand 6 states. [2019-09-08 04:25:05,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:05,334 INFO L93 Difference]: Finished difference Result 1777 states and 2884 transitions. [2019-09-08 04:25:05,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:25:05,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 04:25:05,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:05,346 INFO L225 Difference]: With dead ends: 1777 [2019-09-08 04:25:05,347 INFO L226 Difference]: Without dead ends: 1250 [2019-09-08 04:25:05,350 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 04:25:05,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2019-09-08 04:25:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 1167. [2019-09-08 04:25:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1167 states. [2019-09-08 04:25:05,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1167 states to 1167 states and 1860 transitions. [2019-09-08 04:25:05,416 INFO L78 Accepts]: Start accepts. Automaton has 1167 states and 1860 transitions. Word has length 140 [2019-09-08 04:25:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:05,417 INFO L475 AbstractCegarLoop]: Abstraction has 1167 states and 1860 transitions. [2019-09-08 04:25:05,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 1167 states and 1860 transitions. [2019-09-08 04:25:05,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 04:25:05,421 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:05,422 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:25:05,422 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:05,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:05,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1854401282, now seen corresponding path program 1 times [2019-09-08 04:25:05,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:05,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:05,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:05,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:05,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:05,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:05,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:05,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:05,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:05,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:05,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:05,591 INFO L87 Difference]: Start difference. First operand 1167 states and 1860 transitions. Second operand 6 states. [2019-09-08 04:25:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:09,928 INFO L93 Difference]: Finished difference Result 3724 states and 6160 transitions. [2019-09-08 04:25:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:25:09,929 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 04:25:09,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:09,952 INFO L225 Difference]: With dead ends: 3724 [2019-09-08 04:25:09,952 INFO L226 Difference]: Without dead ends: 2624 [2019-09-08 04:25:09,961 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 04:25:09,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2019-09-08 04:25:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2428. [2019-09-08 04:25:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2428 states. [2019-09-08 04:25:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2428 states to 2428 states and 3951 transitions. [2019-09-08 04:25:10,133 INFO L78 Accepts]: Start accepts. Automaton has 2428 states and 3951 transitions. Word has length 141 [2019-09-08 04:25:10,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:10,133 INFO L475 AbstractCegarLoop]: Abstraction has 2428 states and 3951 transitions. [2019-09-08 04:25:10,134 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:10,134 INFO L276 IsEmpty]: Start isEmpty. Operand 2428 states and 3951 transitions. [2019-09-08 04:25:10,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:25:10,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:10,139 INFO L399 BasicCegarLoop]: trace histogram [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 04:25:10,139 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:10,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:10,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2086190540, now seen corresponding path program 1 times [2019-09-08 04:25:10,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:10,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:10,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:10,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:10,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:10,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:10,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:10,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:10,301 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:10,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:10,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:10,301 INFO L87 Difference]: Start difference. First operand 2428 states and 3951 transitions. Second operand 6 states. [2019-09-08 04:25:14,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:14,517 INFO L93 Difference]: Finished difference Result 8163 states and 13810 transitions. [2019-09-08 04:25:14,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:25:14,518 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 04:25:14,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:14,558 INFO L225 Difference]: With dead ends: 8163 [2019-09-08 04:25:14,558 INFO L226 Difference]: Without dead ends: 5804 [2019-09-08 04:25:14,576 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 04:25:14,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5804 states. [2019-09-08 04:25:14,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5804 to 5283. [2019-09-08 04:25:14,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5283 states. [2019-09-08 04:25:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 8798 transitions. [2019-09-08 04:25:14,904 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 8798 transitions. Word has length 142 [2019-09-08 04:25:14,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:14,906 INFO L475 AbstractCegarLoop]: Abstraction has 5283 states and 8798 transitions. [2019-09-08 04:25:14,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:14,906 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 8798 transitions. [2019-09-08 04:25:14,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 04:25:14,912 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:14,913 INFO L399 BasicCegarLoop]: trace histogram [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 04:25:14,913 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:14,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:14,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1197315910, now seen corresponding path program 1 times [2019-09-08 04:25:14,913 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:14,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:14,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:14,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:14,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:15,066 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:15,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:15,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:15,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:15,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:15,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:15,068 INFO L87 Difference]: Start difference. First operand 5283 states and 8798 transitions. Second operand 6 states. [2019-09-08 04:25:19,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:19,758 INFO L93 Difference]: Finished difference Result 18708 states and 32638 transitions. [2019-09-08 04:25:19,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:25:19,759 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 04:25:19,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:19,896 INFO L225 Difference]: With dead ends: 18708 [2019-09-08 04:25:19,897 INFO L226 Difference]: Without dead ends: 13498 [2019-09-08 04:25:20,038 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 04:25:20,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13498 states. [2019-09-08 04:25:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13498 to 12022. [2019-09-08 04:25:20,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12022 states. [2019-09-08 04:25:20,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12022 states to 12022 states and 20671 transitions. [2019-09-08 04:25:20,835 INFO L78 Accepts]: Start accepts. Automaton has 12022 states and 20671 transitions. Word has length 143 [2019-09-08 04:25:20,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:20,835 INFO L475 AbstractCegarLoop]: Abstraction has 12022 states and 20671 transitions. [2019-09-08 04:25:20,835 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:20,835 INFO L276 IsEmpty]: Start isEmpty. Operand 12022 states and 20671 transitions. [2019-09-08 04:25:20,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 04:25:20,840 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:20,840 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:25:20,840 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:20,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:20,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1130931207, now seen corresponding path program 1 times [2019-09-08 04:25:20,841 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:20,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:20,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:20,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:20,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:20,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:25:20,983 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:25:20,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:25:20,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:25:20,984 INFO L87 Difference]: Start difference. First operand 12022 states and 20671 transitions. Second operand 9 states. [2019-09-08 04:25:29,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:29,961 INFO L93 Difference]: Finished difference Result 38849 states and 66933 transitions. [2019-09-08 04:25:29,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 04:25:29,962 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 144 [2019-09-08 04:25:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:30,257 INFO L225 Difference]: With dead ends: 38849 [2019-09-08 04:25:30,257 INFO L226 Difference]: Without dead ends: 26908 [2019-09-08 04:25:30,361 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=437, Unknown=0, NotChecked=0, Total=552 [2019-09-08 04:25:30,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26908 states. [2019-09-08 04:25:31,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26908 to 26489. [2019-09-08 04:25:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26489 states. [2019-09-08 04:25:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26489 states to 26489 states and 45285 transitions. [2019-09-08 04:25:32,150 INFO L78 Accepts]: Start accepts. Automaton has 26489 states and 45285 transitions. Word has length 144 [2019-09-08 04:25:32,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:32,152 INFO L475 AbstractCegarLoop]: Abstraction has 26489 states and 45285 transitions. [2019-09-08 04:25:32,152 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:25:32,152 INFO L276 IsEmpty]: Start isEmpty. Operand 26489 states and 45285 transitions. [2019-09-08 04:25:32,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:25:32,160 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:32,160 INFO L399 BasicCegarLoop]: trace histogram [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 04:25:32,160 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:32,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:32,161 INFO L82 PathProgramCache]: Analyzing trace with hash -906991434, now seen corresponding path program 1 times [2019-09-08 04:25:32,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:32,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:32,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:32,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:32,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:32,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:32,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:32,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:32,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:25:32,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:25:32,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:25:32,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:25:32,300 INFO L87 Difference]: Start difference. First operand 26489 states and 45285 transitions. Second operand 7 states. [2019-09-08 04:25:34,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:34,151 INFO L93 Difference]: Finished difference Result 53585 states and 91575 transitions. [2019-09-08 04:25:34,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:25:34,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 150 [2019-09-08 04:25:34,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:34,413 INFO L225 Difference]: With dead ends: 53585 [2019-09-08 04:25:34,413 INFO L226 Difference]: Without dead ends: 27177 [2019-09-08 04:25:34,558 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 04:25:34,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27177 states. [2019-09-08 04:25:35,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27177 to 26825. [2019-09-08 04:25:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26825 states. [2019-09-08 04:25:36,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26825 states to 26825 states and 45765 transitions. [2019-09-08 04:25:36,134 INFO L78 Accepts]: Start accepts. Automaton has 26825 states and 45765 transitions. Word has length 150 [2019-09-08 04:25:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:36,135 INFO L475 AbstractCegarLoop]: Abstraction has 26825 states and 45765 transitions. [2019-09-08 04:25:36,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:25:36,135 INFO L276 IsEmpty]: Start isEmpty. Operand 26825 states and 45765 transitions. [2019-09-08 04:25:36,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:25:36,139 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:36,140 INFO L399 BasicCegarLoop]: trace histogram [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 04:25:36,140 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:36,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:36,140 INFO L82 PathProgramCache]: Analyzing trace with hash -2139747080, now seen corresponding path program 1 times [2019-09-08 04:25:36,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:36,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:36,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:36,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:36,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:36,274 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:36,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:36,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:25:36,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:25:36,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:25:36,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:25:36,276 INFO L87 Difference]: Start difference. First operand 26825 states and 45765 transitions. Second operand 5 states. [2019-09-08 04:25:37,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:37,700 INFO L93 Difference]: Finished difference Result 53752 states and 91687 transitions. [2019-09-08 04:25:37,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:25:37,701 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-09-08 04:25:37,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:37,852 INFO L225 Difference]: With dead ends: 53752 [2019-09-08 04:25:37,852 INFO L226 Difference]: Without dead ends: 27008 [2019-09-08 04:25:37,944 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 04:25:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27008 states. [2019-09-08 04:25:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27008 to 26840. [2019-09-08 04:25:40,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26840 states. [2019-09-08 04:25:40,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26840 states to 26840 states and 45783 transitions. [2019-09-08 04:25:40,740 INFO L78 Accepts]: Start accepts. Automaton has 26840 states and 45783 transitions. Word has length 150 [2019-09-08 04:25:40,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:40,740 INFO L475 AbstractCegarLoop]: Abstraction has 26840 states and 45783 transitions. [2019-09-08 04:25:40,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:25:40,740 INFO L276 IsEmpty]: Start isEmpty. Operand 26840 states and 45783 transitions. [2019-09-08 04:25:40,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-09-08 04:25:40,744 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:40,744 INFO L399 BasicCegarLoop]: trace histogram [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 04:25:40,745 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:40,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:40,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1874870327, now seen corresponding path program 1 times [2019-09-08 04:25:40,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:40,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:40,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:40,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:40,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:40,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:25:40,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:25:40,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:25:40,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:25:40,888 INFO L87 Difference]: Start difference. First operand 26840 states and 45783 transitions. Second operand 6 states. [2019-09-08 04:25:47,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:47,980 INFO L93 Difference]: Finished difference Result 98664 states and 178247 transitions. [2019-09-08 04:25:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 04:25:47,982 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 150 [2019-09-08 04:25:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:48,466 INFO L225 Difference]: With dead ends: 98664 [2019-09-08 04:25:48,467 INFO L226 Difference]: Without dead ends: 71905 [2019-09-08 04:25:48,575 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 04:25:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71905 states. [2019-09-08 04:25:53,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71905 to 63238. [2019-09-08 04:25:53,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63238 states. [2019-09-08 04:25:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63238 states to 63238 states and 112534 transitions. [2019-09-08 04:25:53,953 INFO L78 Accepts]: Start accepts. Automaton has 63238 states and 112534 transitions. Word has length 150 [2019-09-08 04:25:53,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:53,953 INFO L475 AbstractCegarLoop]: Abstraction has 63238 states and 112534 transitions. [2019-09-08 04:25:53,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:25:53,954 INFO L276 IsEmpty]: Start isEmpty. Operand 63238 states and 112534 transitions. [2019-09-08 04:25:53,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-08 04:25:53,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:53,957 INFO L399 BasicCegarLoop]: trace histogram [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 04:25:53,957 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:53,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:53,957 INFO L82 PathProgramCache]: Analyzing trace with hash -535561698, now seen corresponding path program 1 times [2019-09-08 04:25:53,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:53,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:53,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:53,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:25:54,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:54,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:25:54,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:25:54,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:25:54,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:25:54,101 INFO L87 Difference]: Start difference. First operand 63238 states and 112534 transitions. Second operand 7 states. [2019-09-08 04:25:59,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:25:59,413 INFO L93 Difference]: Finished difference Result 127563 states and 226759 transitions. [2019-09-08 04:25:59,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:25:59,413 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 149 [2019-09-08 04:25:59,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:25:59,779 INFO L225 Difference]: With dead ends: 127563 [2019-09-08 04:25:59,779 INFO L226 Difference]: Without dead ends: 64422 [2019-09-08 04:25:59,982 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 04:26:00,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64422 states. [2019-09-08 04:26:02,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64422 to 63334. [2019-09-08 04:26:02,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63334 states. [2019-09-08 04:26:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63334 states to 63334 states and 112630 transitions. [2019-09-08 04:26:03,055 INFO L78 Accepts]: Start accepts. Automaton has 63334 states and 112630 transitions. Word has length 149 [2019-09-08 04:26:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:26:03,056 INFO L475 AbstractCegarLoop]: Abstraction has 63334 states and 112630 transitions. [2019-09-08 04:26:03,056 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:26:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 63334 states and 112630 transitions. [2019-09-08 04:26:03,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 04:26:03,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:26:03,060 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:26:03,061 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:26:03,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:26:03,061 INFO L82 PathProgramCache]: Analyzing trace with hash -541782994, now seen corresponding path program 1 times [2019-09-08 04:26:03,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:26:03,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:26:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:03,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:26:03,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:26:03,267 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:26:03,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:26:03,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:26:03,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:26:03,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:26:03,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:26:03,269 INFO L87 Difference]: Start difference. First operand 63334 states and 112630 transitions. Second operand 8 states. [2019-09-08 04:26:16,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:26:16,928 INFO L93 Difference]: Finished difference Result 213831 states and 385073 transitions. [2019-09-08 04:26:16,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:26:16,928 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-09-08 04:26:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:26:18,040 INFO L225 Difference]: With dead ends: 213831 [2019-09-08 04:26:18,040 INFO L226 Difference]: Without dead ends: 150594 [2019-09-08 04:26:18,332 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 04:26:18,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150594 states. [2019-09-08 04:26:30,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150594 to 150464. [2019-09-08 04:26:30,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150464 states. [2019-09-08 04:26:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150464 states to 150464 states and 269251 transitions. [2019-09-08 04:26:31,519 INFO L78 Accepts]: Start accepts. Automaton has 150464 states and 269251 transitions. Word has length 159 [2019-09-08 04:26:31,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:26:31,519 INFO L475 AbstractCegarLoop]: Abstraction has 150464 states and 269251 transitions. [2019-09-08 04:26:31,519 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:26:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 150464 states and 269251 transitions. [2019-09-08 04:26:31,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 04:26:31,523 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:26:31,524 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:26:31,524 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:26:31,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:26:31,524 INFO L82 PathProgramCache]: Analyzing trace with hash -937157415, now seen corresponding path program 1 times [2019-09-08 04:26:31,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:26:31,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:26:31,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:31,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:26:31,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:26:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:26:31,652 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:26:31,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:26:31,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:26:31,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:26:31,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:26:31,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:26:31,654 INFO L87 Difference]: Start difference. First operand 150464 states and 269251 transitions. Second operand 7 states. [2019-09-08 04:26:45,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:26:45,250 INFO L93 Difference]: Finished difference Result 301662 states and 545471 transitions. [2019-09-08 04:26:45,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:26:45,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 160 [2019-09-08 04:26:45,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:26:46,232 INFO L225 Difference]: With dead ends: 301662 [2019-09-08 04:26:46,233 INFO L226 Difference]: Without dead ends: 151232 [2019-09-08 04:26:46,820 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 04:26:46,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151232 states. [2019-09-08 04:27:01,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151232 to 151232. [2019-09-08 04:27:01,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151232 states. [2019-09-08 04:27:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151232 states to 151232 states and 269955 transitions. [2019-09-08 04:27:03,059 INFO L78 Accepts]: Start accepts. Automaton has 151232 states and 269955 transitions. Word has length 160 [2019-09-08 04:27:03,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:27:03,059 INFO L475 AbstractCegarLoop]: Abstraction has 151232 states and 269955 transitions. [2019-09-08 04:27:03,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:27:03,060 INFO L276 IsEmpty]: Start isEmpty. Operand 151232 states and 269955 transitions. [2019-09-08 04:27:03,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 04:27:03,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:27:03,066 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:27:03,066 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:27:03,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:27:03,067 INFO L82 PathProgramCache]: Analyzing trace with hash -40979621, now seen corresponding path program 1 times [2019-09-08 04:27:03,067 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:27:03,067 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:27:03,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:03,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:27:03,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:03,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:27:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 04:27:03,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:27:03,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:27:03,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:27:03,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:27:03,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:27:03,212 INFO L87 Difference]: Start difference. First operand 151232 states and 269955 transitions. Second operand 7 states. [2019-09-08 04:27:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:27:22,218 INFO L93 Difference]: Finished difference Result 280740 states and 502064 transitions. [2019-09-08 04:27:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:27:22,219 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 162 [2019-09-08 04:27:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:27:23,319 INFO L225 Difference]: With dead ends: 280740 [2019-09-08 04:27:23,319 INFO L226 Difference]: Without dead ends: 156499 [2019-09-08 04:27:23,752 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:27:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156499 states. [2019-09-08 04:27:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156499 to 154944. [2019-09-08 04:27:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154944 states. [2019-09-08 04:27:33,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154944 states to 154944 states and 274978 transitions. [2019-09-08 04:27:33,707 INFO L78 Accepts]: Start accepts. Automaton has 154944 states and 274978 transitions. Word has length 162 [2019-09-08 04:27:33,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:27:33,707 INFO L475 AbstractCegarLoop]: Abstraction has 154944 states and 274978 transitions. [2019-09-08 04:27:33,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:27:33,708 INFO L276 IsEmpty]: Start isEmpty. Operand 154944 states and 274978 transitions. [2019-09-08 04:27:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:27:33,712 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:27:33,712 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:27:33,713 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:27:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:27:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1433367631, now seen corresponding path program 1 times [2019-09-08 04:27:33,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:27:33,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:27:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:33,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:27:33,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:27:33,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:27:33,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 04:27:33,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:27:33,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:27:33,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:27:33,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:27:33,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:27:33,836 INFO L87 Difference]: Start difference. First operand 154944 states and 274978 transitions. Second operand 6 states. [2019-09-08 04:27:49,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:27:49,840 INFO L93 Difference]: Finished difference Result 323355 states and 572938 transitions. [2019-09-08 04:27:49,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:27:49,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 166 [2019-09-08 04:27:49,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:27:51,100 INFO L225 Difference]: With dead ends: 323355 [2019-09-08 04:27:51,101 INFO L226 Difference]: Without dead ends: 195402 [2019-09-08 04:27:51,527 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 04:27:51,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195402 states. [2019-09-08 04:28:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195402 to 187204. [2019-09-08 04:28:00,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187204 states. [2019-09-08 04:28:02,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187204 states to 187204 states and 332082 transitions. [2019-09-08 04:28:02,730 INFO L78 Accepts]: Start accepts. Automaton has 187204 states and 332082 transitions. Word has length 166 [2019-09-08 04:28:02,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:28:02,731 INFO L475 AbstractCegarLoop]: Abstraction has 187204 states and 332082 transitions. [2019-09-08 04:28:02,731 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:28:02,731 INFO L276 IsEmpty]: Start isEmpty. Operand 187204 states and 332082 transitions. [2019-09-08 04:28:02,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 04:28:02,735 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:28:02,735 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:28:02,736 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:28:02,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:28:02,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1360981073, now seen corresponding path program 1 times [2019-09-08 04:28:02,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:28:02,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:28:02,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:28:02,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:28:02,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:28:02,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:28:02,902 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 04:28:02,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:28:02,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:28:02,903 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:28:02,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:28:02,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:28:02,904 INFO L87 Difference]: Start difference. First operand 187204 states and 332082 transitions. Second operand 10 states. [2019-09-08 04:28:55,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:28:55,200 INFO L93 Difference]: Finished difference Result 677558 states and 1326324 transitions. [2019-09-08 04:28:55,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:28:55,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 166 [2019-09-08 04:28:55,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:28:58,793 INFO L225 Difference]: With dead ends: 677558 [2019-09-08 04:28:58,793 INFO L226 Difference]: Without dead ends: 490420 [2019-09-08 04:29:00,491 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:29:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490420 states. [2019-09-08 04:29:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490420 to 488289. [2019-09-08 04:29:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488289 states. [2019-09-08 04:30:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488289 states to 488289 states and 919975 transitions. [2019-09-08 04:30:19,097 INFO L78 Accepts]: Start accepts. Automaton has 488289 states and 919975 transitions. Word has length 166 [2019-09-08 04:30:19,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:30:19,097 INFO L475 AbstractCegarLoop]: Abstraction has 488289 states and 919975 transitions. [2019-09-08 04:30:19,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:30:19,098 INFO L276 IsEmpty]: Start isEmpty. Operand 488289 states and 919975 transitions. [2019-09-08 04:30:19,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 04:30:19,106 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:30:19,106 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 04:30:19,107 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:30:19,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:30:19,107 INFO L82 PathProgramCache]: Analyzing trace with hash -568076547, now seen corresponding path program 1 times [2019-09-08 04:30:19,107 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:30:19,107 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:30:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:19,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:30:19,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:30:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:30:19,296 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 04:30:19,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:30:19,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:30:19,297 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:30:19,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:30:19,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:30:19,298 INFO L87 Difference]: Start difference. First operand 488289 states and 919975 transitions. Second operand 10 states.