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_spec14_product23.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 03:40:27,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 03:40:27,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 03:40:27,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 03:40:27,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 03:40:27,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 03:40:27,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 03:40:27,164 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 03:40:27,166 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 03:40:27,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 03:40:27,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 03:40:27,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 03:40:27,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 03:40:27,170 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 03:40:27,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 03:40:27,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 03:40:27,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 03:40:27,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 03:40:27,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 03:40:27,177 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 03:40:27,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 03:40:27,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 03:40:27,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 03:40:27,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 03:40:27,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 03:40:27,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 03:40:27,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 03:40:27,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 03:40:27,189 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 03:40:27,190 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 03:40:27,190 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 03:40:27,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 03:40:27,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 03:40:27,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 03:40:27,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 03:40:27,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 03:40:27,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 03:40:27,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 03:40:27,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 03:40:27,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 03:40:27,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 03:40:27,197 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 03:40:27,211 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 03:40:27,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 03:40:27,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 03:40:27,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 03:40:27,213 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 03:40:27,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 03:40:27,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 03:40:27,214 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 03:40:27,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 03:40:27,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 03:40:27,214 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 03:40:27,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 03:40:27,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 03:40:27,215 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 03:40:27,215 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 03:40:27,215 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 03:40:27,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 03:40:27,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 03:40:27,216 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 03:40:27,216 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 03:40:27,216 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 03:40:27,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:40:27,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 03:40:27,217 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 03:40:27,217 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 03:40:27,217 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 03:40:27,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 03:40:27,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 03:40:27,218 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 03:40:27,246 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 03:40:27,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 03:40:27,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 03:40:27,263 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 03:40:27,264 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 03:40:27,264 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product23.cil.c [2019-09-08 03:40:27,325 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac02c9f6d/efb075a877704643a6772bd8c6005026/FLAG91caf3b78 [2019-09-08 03:40:27,961 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 03:40:27,962 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product23.cil.c [2019-09-08 03:40:27,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac02c9f6d/efb075a877704643a6772bd8c6005026/FLAG91caf3b78 [2019-09-08 03:40:28,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac02c9f6d/efb075a877704643a6772bd8c6005026 [2019-09-08 03:40:28,204 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 03:40:28,205 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 03:40:28,206 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 03:40:28,207 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 03:40:28,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 03:40:28,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:40:28" (1/1) ... [2019-09-08 03:40:28,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@386a8cb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:28, skipping insertion in model container [2019-09-08 03:40:28,216 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:40:28" (1/1) ... [2019-09-08 03:40:28,224 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 03:40:28,304 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 03:40:29,009 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:40:29,036 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 03:40:29,175 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 03:40:29,261 INFO L192 MainTranslator]: Completed translation [2019-09-08 03:40:29,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29 WrapperNode [2019-09-08 03:40:29,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 03:40:29,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 03:40:29,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 03:40:29,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 03:40:29,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (1/1) ... [2019-09-08 03:40:29,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (1/1) ... [2019-09-08 03:40:29,326 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (1/1) ... [2019-09-08 03:40:29,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (1/1) ... [2019-09-08 03:40:29,389 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (1/1) ... [2019-09-08 03:40:29,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (1/1) ... [2019-09-08 03:40:29,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (1/1) ... [2019-09-08 03:40:29,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 03:40:29,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 03:40:29,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 03:40:29,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 03:40:29,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 03:40:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 03:40:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 03:40:29,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 03:40:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 03:40:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 03:40:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 03:40:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 03:40:29,523 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 03:40:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 03:40:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 03:40:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 03:40:29,524 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 03:40:29,525 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 03:40:29,525 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 03:40:29,526 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 03:40:29,526 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 03:40:29,527 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 03:40:29,527 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 03:40:29,527 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 03:40:29,527 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 03:40:29,528 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 03:40:29,528 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 03:40:29,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:40:29,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 03:40:29,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 03:40:29,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 03:40:29,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 03:40:29,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 03:40:29,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 03:40:29,530 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 03:40:29,530 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 03:40:29,530 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 03:40:29,530 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 03:40:29,530 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 03:40:29,530 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 03:40:29,530 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 03:40:29,531 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 03:40:29,531 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 03:40:29,531 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 03:40:29,531 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 03:40:29,531 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 03:40:29,532 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-09-08 03:40:29,532 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 03:40:29,532 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 03:40:29,532 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 03:40:29,532 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 03:40:29,532 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 03:40:29,533 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 03:40:29,533 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 03:40:29,533 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 03:40:29,533 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 03:40:29,533 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 03:40:29,534 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 03:40:29,534 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 03:40:29,534 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 03:40:29,534 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 03:40:29,534 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 03:40:29,535 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 03:40:29,535 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 03:40:29,536 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 03:40:29,536 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 03:40:29,536 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 03:40:29,536 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 03:40:29,536 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 03:40:29,537 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 03:40:29,537 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 03:40:29,537 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 03:40:29,537 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-09-08 03:40:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-09-08 03:40:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 03:40:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 03:40:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 03:40:29,538 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 03:40:29,539 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 03:40:29,539 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 03:40:29,539 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 03:40:29,540 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 03:40:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 03:40:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 03:40:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 03:40:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 03:40:29,540 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 03:40:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 03:40:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 03:40:29,541 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 03:40:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 03:40:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 03:40:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 03:40:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 03:40:29,542 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 03:40:29,543 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 03:40:29,543 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 03:40:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 03:40:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 03:40:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 03:40:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 03:40:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 03:40:29,544 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 03:40:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 03:40:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 03:40:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 03:40:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 03:40:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 03:40:29,545 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 03:40:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 03:40:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 03:40:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 03:40:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 03:40:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 03:40:29,546 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 03:40:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 03:40:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 03:40:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 03:40:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 03:40:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-09-08 03:40:29,547 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-09-08 03:40:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-09-08 03:40:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 03:40:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 03:40:29,548 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 03:40:29,549 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 03:40:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 03:40:29,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 03:40:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 03:40:29,551 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 03:40:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 03:40:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 03:40:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 03:40:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 03:40:29,552 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 03:40:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 03:40:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 03:40:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 03:40:29,553 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 03:40:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 03:40:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 03:40:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 03:40:29,554 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 03:40:29,555 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 03:40:29,555 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 03:40:29,558 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 03:40:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 03:40:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 03:40:29,559 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 03:40:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 03:40:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 03:40:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 03:40:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 03:40:29,566 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-09-08 03:40:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 03:40:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 03:40:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 03:40:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 03:40:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 03:40:29,567 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 03:40:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-09-08 03:40:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-09-08 03:40:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 03:40:29,568 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 03:40:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-09-08 03:40:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-09-08 03:40:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 03:40:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 03:40:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 03:40:29,569 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 03:40:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 03:40:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 03:40:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 03:40:29,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 03:40:31,676 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 03:40:31,676 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 03:40:31,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:40:31 BoogieIcfgContainer [2019-09-08 03:40:31,678 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 03:40:31,679 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 03:40:31,679 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 03:40:31,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 03:40:31,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:40:28" (1/3) ... [2019-09-08 03:40:31,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:40:31, skipping insertion in model container [2019-09-08 03:40:31,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:40:29" (2/3) ... [2019-09-08 03:40:31,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:40:31, skipping insertion in model container [2019-09-08 03:40:31,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:40:31" (3/3) ... [2019-09-08 03:40:31,685 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product23.cil.c [2019-09-08 03:40:31,695 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 03:40:31,703 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 03:40:31,720 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 03:40:31,759 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 03:40:31,760 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 03:40:31,760 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 03:40:31,761 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 03:40:31,761 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 03:40:31,761 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 03:40:31,761 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 03:40:31,761 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 03:40:31,762 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 03:40:31,805 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states. [2019-09-08 03:40:31,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 03:40:31,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:31,837 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:31,839 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:31,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash 1117426819, now seen corresponding path program 1 times [2019-09-08 03:40:31,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:31,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:31,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:31,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:32,393 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:32,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:32,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:40:32,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:40:32,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:40:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:40:32,418 INFO L87 Difference]: Start difference. First operand 766 states. Second operand 4 states. [2019-09-08 03:40:32,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:32,696 INFO L93 Difference]: Finished difference Result 1230 states and 1960 transitions. [2019-09-08 03:40:32,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:40:32,698 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 03:40:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:32,741 INFO L225 Difference]: With dead ends: 1230 [2019-09-08 03:40:32,742 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:40:32,758 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 03:40:32,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:40:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:40:32,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:40:32,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 971 transitions. [2019-09-08 03:40:32,914 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 971 transitions. Word has length 135 [2019-09-08 03:40:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:32,916 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 971 transitions. [2019-09-08 03:40:32,916 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:40:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 971 transitions. [2019-09-08 03:40:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 03:40:32,936 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:32,936 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:32,936 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1099628587, now seen corresponding path program 1 times [2019-09-08 03:40:32,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:32,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:33,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:33,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:40:33,218 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:40:33,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:40:33,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:40:33,219 INFO L87 Difference]: Start difference. First operand 618 states and 971 transitions. Second operand 4 states. [2019-09-08 03:40:33,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:33,314 INFO L93 Difference]: Finished difference Result 1203 states and 1903 transitions. [2019-09-08 03:40:33,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:40:33,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 03:40:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:33,322 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 03:40:33,322 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:40:33,326 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 03:40:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:40:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:40:33,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:40:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 970 transitions. [2019-09-08 03:40:33,368 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 970 transitions. Word has length 136 [2019-09-08 03:40:33,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:33,370 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 970 transitions. [2019-09-08 03:40:33,370 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:40:33,371 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 970 transitions. [2019-09-08 03:40:33,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 03:40:33,384 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:33,384 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:33,384 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:33,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash 896519935, now seen corresponding path program 1 times [2019-09-08 03:40:33,387 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:33,387 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:33,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:33,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:33,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:33,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:33,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:40:33,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:40:33,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:40:33,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:40:33,542 INFO L87 Difference]: Start difference. First operand 618 states and 970 transitions. Second operand 4 states. [2019-09-08 03:40:33,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:33,655 INFO L93 Difference]: Finished difference Result 1203 states and 1902 transitions. [2019-09-08 03:40:33,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:40:33,656 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-09-08 03:40:33,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:33,661 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 03:40:33,661 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:40:33,664 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 03:40:33,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:40:33,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:40:33,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:40:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 969 transitions. [2019-09-08 03:40:33,690 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 969 transitions. Word has length 137 [2019-09-08 03:40:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:33,691 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 969 transitions. [2019-09-08 03:40:33,691 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:40:33,691 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 969 transitions. [2019-09-08 03:40:33,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 03:40:33,696 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:33,697 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:33,697 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:33,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash -756244441, now seen corresponding path program 1 times [2019-09-08 03:40:33,697 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:33,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:33,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:33,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:33,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:33,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:33,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:40:33,823 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:40:33,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:40:33,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:40:33,824 INFO L87 Difference]: Start difference. First operand 618 states and 969 transitions. Second operand 4 states. [2019-09-08 03:40:33,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:33,931 INFO L93 Difference]: Finished difference Result 1203 states and 1901 transitions. [2019-09-08 03:40:33,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:40:33,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 03:40:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:33,941 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 03:40:33,942 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:40:33,949 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 03:40:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:40:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:40:33,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:40:33,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 968 transitions. [2019-09-08 03:40:33,984 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 968 transitions. Word has length 138 [2019-09-08 03:40:33,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:33,984 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 968 transitions. [2019-09-08 03:40:33,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:40:33,984 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 968 transitions. [2019-09-08 03:40:33,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 03:40:33,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:33,991 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:33,992 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:33,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:33,992 INFO L82 PathProgramCache]: Analyzing trace with hash -103696005, now seen corresponding path program 1 times [2019-09-08 03:40:33,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:33,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:33,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:33,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:33,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:34,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:34,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:34,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:40:34,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:40:34,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:40:34,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:40:34,127 INFO L87 Difference]: Start difference. First operand 618 states and 968 transitions. Second operand 4 states. [2019-09-08 03:40:34,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:34,197 INFO L93 Difference]: Finished difference Result 1203 states and 1900 transitions. [2019-09-08 03:40:34,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:40:34,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-09-08 03:40:34,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:34,207 INFO L225 Difference]: With dead ends: 1203 [2019-09-08 03:40:34,207 INFO L226 Difference]: Without dead ends: 618 [2019-09-08 03:40:34,213 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 03:40:34,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2019-09-08 03:40:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 618. [2019-09-08 03:40:34,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2019-09-08 03:40:34,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 967 transitions. [2019-09-08 03:40:34,238 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 967 transitions. Word has length 139 [2019-09-08 03:40:34,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:34,238 INFO L475 AbstractCegarLoop]: Abstraction has 618 states and 967 transitions. [2019-09-08 03:40:34,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:40:34,238 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 967 transitions. [2019-09-08 03:40:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:40:34,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:34,244 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:34,244 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:34,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:34,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1000894429, now seen corresponding path program 1 times [2019-09-08 03:40:34,246 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:34,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:34,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:34,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:34,450 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:34,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:34,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 03:40:34,451 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:40:34,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:40:34,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:40:34,452 INFO L87 Difference]: Start difference. First operand 618 states and 967 transitions. Second operand 10 states. [2019-09-08 03:40:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:34,689 INFO L93 Difference]: Finished difference Result 1208 states and 1907 transitions. [2019-09-08 03:40:34,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:40:34,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-09-08 03:40:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:34,694 INFO L225 Difference]: With dead ends: 1208 [2019-09-08 03:40:34,694 INFO L226 Difference]: Without dead ends: 627 [2019-09-08 03:40:34,698 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 03:40:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-09-08 03:40:34,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 625. [2019-09-08 03:40:34,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-09-08 03:40:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 977 transitions. [2019-09-08 03:40:34,724 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 977 transitions. Word has length 140 [2019-09-08 03:40:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:34,724 INFO L475 AbstractCegarLoop]: Abstraction has 625 states and 977 transitions. [2019-09-08 03:40:34,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:40:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 977 transitions. [2019-09-08 03:40:34,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 03:40:34,729 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:34,730 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:34,730 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:34,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:34,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1987477118, now seen corresponding path program 1 times [2019-09-08 03:40:34,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:34,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:34,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:34,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:34,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:34,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:34,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:40:34,840 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:40:34,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:40:34,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:40:34,840 INFO L87 Difference]: Start difference. First operand 625 states and 977 transitions. Second operand 4 states. [2019-09-08 03:40:34,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:34,909 INFO L93 Difference]: Finished difference Result 1209 states and 1908 transitions. [2019-09-08 03:40:34,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:40:34,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-09-08 03:40:34,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:34,915 INFO L225 Difference]: With dead ends: 1209 [2019-09-08 03:40:34,916 INFO L226 Difference]: Without dead ends: 621 [2019-09-08 03:40:34,919 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 03:40:34,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-09-08 03:40:34,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-09-08 03:40:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-09-08 03:40:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 970 transitions. [2019-09-08 03:40:34,945 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 970 transitions. Word has length 140 [2019-09-08 03:40:34,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:34,946 INFO L475 AbstractCegarLoop]: Abstraction has 621 states and 970 transitions. [2019-09-08 03:40:34,946 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:40:34,946 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 970 transitions. [2019-09-08 03:40:34,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 03:40:34,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:34,952 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:34,952 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:34,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:34,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1145901007, now seen corresponding path program 1 times [2019-09-08 03:40:34,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:34,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:34,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:34,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:34,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:35,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:35,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:40:35,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:40:35,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:40:35,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:40:35,080 INFO L87 Difference]: Start difference. First operand 621 states and 970 transitions. Second operand 6 states. [2019-09-08 03:40:35,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:35,369 INFO L93 Difference]: Finished difference Result 1222 states and 1932 transitions. [2019-09-08 03:40:35,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:40:35,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-09-08 03:40:35,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:35,377 INFO L225 Difference]: With dead ends: 1222 [2019-09-08 03:40:35,377 INFO L226 Difference]: Without dead ends: 629 [2019-09-08 03:40:35,381 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 03:40:35,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2019-09-08 03:40:35,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 626. [2019-09-08 03:40:35,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:40:35,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 971 transitions. [2019-09-08 03:40:35,449 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 971 transitions. Word has length 141 [2019-09-08 03:40:35,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:35,450 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 971 transitions. [2019-09-08 03:40:35,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:40:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 971 transitions. [2019-09-08 03:40:35,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 03:40:35,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:35,455 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:35,455 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1935329146, now seen corresponding path program 1 times [2019-09-08 03:40:35,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:35,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:35,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:35,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:35,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:35,596 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:35,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:35,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:40:35,597 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:40:35,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:40:35,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:40:35,598 INFO L87 Difference]: Start difference. First operand 626 states and 971 transitions. Second operand 6 states. [2019-09-08 03:40:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:35,834 INFO L93 Difference]: Finished difference Result 1185 states and 1847 transitions. [2019-09-08 03:40:35,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:40:35,834 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-09-08 03:40:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:35,843 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 03:40:35,843 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:40:35,847 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 03:40:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:40:35,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:40:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:40:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 967 transitions. [2019-09-08 03:40:35,882 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 967 transitions. Word has length 142 [2019-09-08 03:40:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:35,882 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 967 transitions. [2019-09-08 03:40:35,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:40:35,883 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 967 transitions. [2019-09-08 03:40:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 03:40:35,887 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:35,887 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:35,887 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:35,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:35,888 INFO L82 PathProgramCache]: Analyzing trace with hash 210411572, now seen corresponding path program 1 times [2019-09-08 03:40:35,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:35,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:35,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:35,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:35,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:35,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:36,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:36,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:36,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:40:36,016 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:40:36,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:40:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:40:36,016 INFO L87 Difference]: Start difference. First operand 626 states and 967 transitions. Second operand 6 states. [2019-09-08 03:40:36,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:36,230 INFO L93 Difference]: Finished difference Result 1185 states and 1843 transitions. [2019-09-08 03:40:36,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:40:36,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 03:40:36,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:36,235 INFO L225 Difference]: With dead ends: 1185 [2019-09-08 03:40:36,235 INFO L226 Difference]: Without dead ends: 626 [2019-09-08 03:40:36,239 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 03:40:36,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2019-09-08 03:40:36,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 626. [2019-09-08 03:40:36,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 626 states. [2019-09-08 03:40:36,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 963 transitions. [2019-09-08 03:40:36,263 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 963 transitions. Word has length 143 [2019-09-08 03:40:36,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:36,264 INFO L475 AbstractCegarLoop]: Abstraction has 626 states and 963 transitions. [2019-09-08 03:40:36,264 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:40:36,264 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 963 transitions. [2019-09-08 03:40:36,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 03:40:36,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:36,269 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:36,269 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:36,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:36,269 INFO L82 PathProgramCache]: Analyzing trace with hash 487742644, now seen corresponding path program 1 times [2019-09-08 03:40:36,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:36,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:36,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:36,408 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:36,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:36,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 03:40:36,410 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 03:40:36,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 03:40:36,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 03:40:36,411 INFO L87 Difference]: Start difference. First operand 626 states and 963 transitions. Second operand 7 states. [2019-09-08 03:40:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:36,520 INFO L93 Difference]: Finished difference Result 1188 states and 1843 transitions. [2019-09-08 03:40:36,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 03:40:36,521 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-09-08 03:40:36,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:36,562 INFO L225 Difference]: With dead ends: 1188 [2019-09-08 03:40:36,562 INFO L226 Difference]: Without dead ends: 608 [2019-09-08 03:40:36,566 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 03:40:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2019-09-08 03:40:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2019-09-08 03:40:36,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 03:40:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 926 transitions. [2019-09-08 03:40:36,592 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 926 transitions. Word has length 143 [2019-09-08 03:40:36,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:36,593 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 926 transitions. [2019-09-08 03:40:36,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 03:40:36,593 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 926 transitions. [2019-09-08 03:40:36,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 03:40:36,598 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:36,598 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:36,598 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:36,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:36,599 INFO L82 PathProgramCache]: Analyzing trace with hash 1183492043, now seen corresponding path program 1 times [2019-09-08 03:40:36,599 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:36,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:36,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:36,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:36,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:36,723 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:36,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:36,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:40:36,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:40:36,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:40:36,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:40:36,725 INFO L87 Difference]: Start difference. First operand 605 states and 926 transitions. Second operand 6 states. [2019-09-08 03:40:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:36,878 INFO L93 Difference]: Finished difference Result 1164 states and 1802 transitions. [2019-09-08 03:40:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:40:36,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-09-08 03:40:36,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:36,886 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 03:40:36,886 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 03:40:36,891 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 03:40:36,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 03:40:36,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-09-08 03:40:36,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 03:40:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 925 transitions. [2019-09-08 03:40:36,924 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 925 transitions. Word has length 144 [2019-09-08 03:40:36,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:36,925 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 925 transitions. [2019-09-08 03:40:36,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:40:36,926 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 925 transitions. [2019-09-08 03:40:36,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 03:40:36,933 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:36,933 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:36,934 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:36,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:36,934 INFO L82 PathProgramCache]: Analyzing trace with hash 163843225, now seen corresponding path program 1 times [2019-09-08 03:40:36,934 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:36,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:36,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:36,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:36,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:37,108 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:37,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:37,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 03:40:37,110 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 03:40:37,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 03:40:37,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 03:40:37,111 INFO L87 Difference]: Start difference. First operand 605 states and 925 transitions. Second operand 6 states. [2019-09-08 03:40:37,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:37,247 INFO L93 Difference]: Finished difference Result 1164 states and 1801 transitions. [2019-09-08 03:40:37,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 03:40:37,248 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-09-08 03:40:37,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:37,252 INFO L225 Difference]: With dead ends: 1164 [2019-09-08 03:40:37,252 INFO L226 Difference]: Without dead ends: 605 [2019-09-08 03:40:37,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 03:40:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-09-08 03:40:37,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 605. [2019-09-08 03:40:37,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-09-08 03:40:37,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 924 transitions. [2019-09-08 03:40:37,283 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 924 transitions. Word has length 145 [2019-09-08 03:40:37,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:37,284 INFO L475 AbstractCegarLoop]: Abstraction has 605 states and 924 transitions. [2019-09-08 03:40:37,284 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 03:40:37,284 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 924 transitions. [2019-09-08 03:40:37,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-09-08 03:40:37,289 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:37,289 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:37,289 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:37,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:37,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1794095888, now seen corresponding path program 1 times [2019-09-08 03:40:37,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:37,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:37,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:37,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:37,471 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-09-08 03:40:37,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:40:37,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 03:40:37,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 03:40:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 03:40:37,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 03:40:37,473 INFO L87 Difference]: Start difference. First operand 605 states and 924 transitions. Second operand 12 states. [2019-09-08 03:40:37,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:37,768 INFO L93 Difference]: Finished difference Result 1170 states and 1811 transitions. [2019-09-08 03:40:37,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 03:40:37,768 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-09-08 03:40:37,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:37,772 INFO L225 Difference]: With dead ends: 1170 [2019-09-08 03:40:37,773 INFO L226 Difference]: Without dead ends: 612 [2019-09-08 03:40:37,776 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 03:40:37,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2019-09-08 03:40:37,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 610. [2019-09-08 03:40:37,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-09-08 03:40:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 930 transitions. [2019-09-08 03:40:37,796 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 930 transitions. Word has length 146 [2019-09-08 03:40:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:37,796 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 930 transitions. [2019-09-08 03:40:37,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 03:40:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 930 transitions. [2019-09-08 03:40:37,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 03:40:37,801 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:37,801 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:37,801 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:37,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:37,802 INFO L82 PathProgramCache]: Analyzing trace with hash 114192712, now seen corresponding path program 1 times [2019-09-08 03:40:37,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:37,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:37,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:37,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:37,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:37,961 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:40:37,961 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:37,961 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:37,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:38,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:38,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 2631 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:40:38,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-08 03:40:38,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:38,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:40:38,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:40:38,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:40:38,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:40:38,510 INFO L87 Difference]: Start difference. First operand 610 states and 930 transitions. Second operand 13 states. [2019-09-08 03:40:49,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:49,679 INFO L93 Difference]: Finished difference Result 1782 states and 2859 transitions. [2019-09-08 03:40:49,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:40:49,679 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 147 [2019-09-08 03:40:49,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:49,690 INFO L225 Difference]: With dead ends: 1782 [2019-09-08 03:40:49,690 INFO L226 Difference]: Without dead ends: 1225 [2019-09-08 03:40:49,695 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 162 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:40:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-08 03:40:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1208. [2019-09-08 03:40:49,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-09-08 03:40:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1904 transitions. [2019-09-08 03:40:49,752 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1904 transitions. Word has length 147 [2019-09-08 03:40:49,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:49,752 INFO L475 AbstractCegarLoop]: Abstraction has 1208 states and 1904 transitions. [2019-09-08 03:40:49,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:40:49,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1904 transitions. [2019-09-08 03:40:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:40:49,757 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:49,757 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:49,758 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:49,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:49,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1159837229, now seen corresponding path program 1 times [2019-09-08 03:40:49,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:49,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:49,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:49,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:49,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:50,060 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:40:50,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:50,062 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:50,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:50,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:40:50,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:50,531 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 03:40:50,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:50,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2019-09-08 03:40:50,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 03:40:50,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 03:40:50,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:40:50,540 INFO L87 Difference]: Start difference. First operand 1208 states and 1904 transitions. Second operand 10 states. [2019-09-08 03:40:51,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:40:51,769 INFO L93 Difference]: Finished difference Result 2400 states and 3875 transitions. [2019-09-08 03:40:51,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 03:40:51,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 156 [2019-09-08 03:40:51,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:40:51,779 INFO L225 Difference]: With dead ends: 2400 [2019-09-08 03:40:51,779 INFO L226 Difference]: Without dead ends: 1245 [2019-09-08 03:40:51,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 154 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-09-08 03:40:51,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2019-09-08 03:40:51,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 1237. [2019-09-08 03:40:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1237 states. [2019-09-08 03:40:51,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1956 transitions. [2019-09-08 03:40:51,842 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1956 transitions. Word has length 156 [2019-09-08 03:40:51,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:40:51,842 INFO L475 AbstractCegarLoop]: Abstraction has 1237 states and 1956 transitions. [2019-09-08 03:40:51,843 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 03:40:51,843 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1956 transitions. [2019-09-08 03:40:51,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 03:40:51,848 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:40:51,848 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:40:51,849 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:40:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:40:51,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1113293167, now seen corresponding path program 1 times [2019-09-08 03:40:51,849 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:40:51,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:40:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:51,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:51,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:40:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:52,027 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-09-08 03:40:52,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:40:52,027 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:40:52,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:40:52,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:40:52,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 2638 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:40:52,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:40:52,585 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-09-08 03:40:52,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:40:52,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:40:52,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:40:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:40:52,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:40:52,603 INFO L87 Difference]: Start difference. First operand 1237 states and 1956 transitions. Second operand 13 states. [2019-09-08 03:41:03,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:03,766 INFO L93 Difference]: Finished difference Result 3871 states and 6321 transitions. [2019-09-08 03:41:03,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:41:03,767 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 155 [2019-09-08 03:41:03,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:03,785 INFO L225 Difference]: With dead ends: 3871 [2019-09-08 03:41:03,785 INFO L226 Difference]: Without dead ends: 2687 [2019-09-08 03:41:03,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 168 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:41:03,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2019-09-08 03:41:03,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2629. [2019-09-08 03:41:03,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2629 states. [2019-09-08 03:41:03,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 4219 transitions. [2019-09-08 03:41:03,927 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 4219 transitions. Word has length 155 [2019-09-08 03:41:03,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:03,928 INFO L475 AbstractCegarLoop]: Abstraction has 2629 states and 4219 transitions. [2019-09-08 03:41:03,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:41:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 4219 transitions. [2019-09-08 03:41:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-08 03:41:03,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:03,935 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:03,936 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:03,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:03,936 INFO L82 PathProgramCache]: Analyzing trace with hash -938944175, now seen corresponding path program 1 times [2019-09-08 03:41:03,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:03,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:03,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:03,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:03,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:04,119 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-09-08 03:41:04,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:41:04,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:41:04,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:04,531 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 03:41:04,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:41:04,622 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-08 03:41:04,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:41:04,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:41:04,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:41:04,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:41:04,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:41:04,639 INFO L87 Difference]: Start difference. First operand 2629 states and 4219 transitions. Second operand 13 states. [2019-09-08 03:41:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:15,974 INFO L93 Difference]: Finished difference Result 7474 states and 12264 transitions. [2019-09-08 03:41:15,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 03:41:15,974 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 156 [2019-09-08 03:41:15,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:16,008 INFO L225 Difference]: With dead ends: 7474 [2019-09-08 03:41:16,009 INFO L226 Difference]: Without dead ends: 4904 [2019-09-08 03:41:16,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=702, Unknown=0, NotChecked=0, Total=870 [2019-09-08 03:41:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4904 states. [2019-09-08 03:41:16,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4904 to 4789. [2019-09-08 03:41:16,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4789 states. [2019-09-08 03:41:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4789 states to 4789 states and 7733 transitions. [2019-09-08 03:41:16,265 INFO L78 Accepts]: Start accepts. Automaton has 4789 states and 7733 transitions. Word has length 156 [2019-09-08 03:41:16,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:16,265 INFO L475 AbstractCegarLoop]: Abstraction has 4789 states and 7733 transitions. [2019-09-08 03:41:16,265 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:41:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 4789 states and 7733 transitions. [2019-09-08 03:41:16,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 03:41:16,275 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:16,276 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:16,276 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:16,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:16,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1389283025, now seen corresponding path program 1 times [2019-09-08 03:41:16,277 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:16,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:16,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:16,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:16,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:16,440 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:41:16,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:41:16,441 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:41:16,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:41:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:16,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 2642 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-08 03:41:16,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:41:16,863 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:41:16,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:41:16,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2019-09-08 03:41:16,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 03:41:16,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 03:41:16,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-09-08 03:41:16,872 INFO L87 Difference]: Start difference. First operand 4789 states and 7733 transitions. Second operand 13 states. [2019-09-08 03:41:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:33,751 INFO L93 Difference]: Finished difference Result 20216 states and 33307 transitions. [2019-09-08 03:41:33,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-09-08 03:41:33,751 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 159 [2019-09-08 03:41:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:33,862 INFO L225 Difference]: With dead ends: 20216 [2019-09-08 03:41:33,862 INFO L226 Difference]: Without dead ends: 15492 [2019-09-08 03:41:33,890 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 527 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=279, Invalid=1883, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 03:41:33,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15492 states. [2019-09-08 03:41:35,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15492 to 15091. [2019-09-08 03:41:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15091 states. [2019-09-08 03:41:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15091 states to 15091 states and 24616 transitions. [2019-09-08 03:41:35,447 INFO L78 Accepts]: Start accepts. Automaton has 15091 states and 24616 transitions. Word has length 159 [2019-09-08 03:41:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:35,447 INFO L475 AbstractCegarLoop]: Abstraction has 15091 states and 24616 transitions. [2019-09-08 03:41:35,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 03:41:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 15091 states and 24616 transitions. [2019-09-08 03:41:35,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 03:41:35,460 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:35,460 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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 03:41:35,461 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:35,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:35,461 INFO L82 PathProgramCache]: Analyzing trace with hash -2046822613, now seen corresponding path program 1 times [2019-09-08 03:41:35,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:35,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:35,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:35,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-09-08 03:41:35,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:35,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:41:35,599 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:41:35,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:41:35,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:41:35,600 INFO L87 Difference]: Start difference. First operand 15091 states and 24616 transitions. Second operand 9 states. [2019-09-08 03:41:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:36,134 INFO L93 Difference]: Finished difference Result 21238 states and 34540 transitions. [2019-09-08 03:41:36,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:41:36,135 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 03:41:36,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:36,183 INFO L225 Difference]: With dead ends: 21238 [2019-09-08 03:41:36,184 INFO L226 Difference]: Without dead ends: 6194 [2019-09-08 03:41:36,253 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:41:36,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6194 states. [2019-09-08 03:41:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6194 to 6190. [2019-09-08 03:41:36,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6190 states. [2019-09-08 03:41:36,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6190 states to 6190 states and 9961 transitions. [2019-09-08 03:41:36,583 INFO L78 Accepts]: Start accepts. Automaton has 6190 states and 9961 transitions. Word has length 167 [2019-09-08 03:41:36,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:36,584 INFO L475 AbstractCegarLoop]: Abstraction has 6190 states and 9961 transitions. [2019-09-08 03:41:36,584 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:41:36,584 INFO L276 IsEmpty]: Start isEmpty. Operand 6190 states and 9961 transitions. [2019-09-08 03:41:36,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 03:41:36,590 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:36,590 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:36,591 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:36,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:36,591 INFO L82 PathProgramCache]: Analyzing trace with hash -2011002107, now seen corresponding path program 1 times [2019-09-08 03:41:36,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:36,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:36,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:36,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:36,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:36,821 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-08 03:41:36,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:41:36,822 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:41:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:37,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:37,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 2696 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 03:41:37,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:41:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 03:41:37,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:41:37,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2019-09-08 03:41:37,244 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 03:41:37,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 03:41:37,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-08 03:41:37,253 INFO L87 Difference]: Start difference. First operand 6190 states and 9961 transitions. Second operand 11 states. [2019-09-08 03:41:51,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:51,888 INFO L93 Difference]: Finished difference Result 15477 states and 25201 transitions. [2019-09-08 03:41:51,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-08 03:41:51,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 175 [2019-09-08 03:41:51,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:51,936 INFO L225 Difference]: With dead ends: 15477 [2019-09-08 03:41:51,936 INFO L226 Difference]: Without dead ends: 9340 [2019-09-08 03:41:51,956 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 03:41:51,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9340 states. [2019-09-08 03:41:52,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9340 to 6118. [2019-09-08 03:41:52,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6118 states. [2019-09-08 03:41:52,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6118 states to 6118 states and 9818 transitions. [2019-09-08 03:41:52,276 INFO L78 Accepts]: Start accepts. Automaton has 6118 states and 9818 transitions. Word has length 175 [2019-09-08 03:41:52,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:52,279 INFO L475 AbstractCegarLoop]: Abstraction has 6118 states and 9818 transitions. [2019-09-08 03:41:52,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 03:41:52,279 INFO L276 IsEmpty]: Start isEmpty. Operand 6118 states and 9818 transitions. [2019-09-08 03:41:52,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-09-08 03:41:52,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:52,284 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:41:52,284 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1902038756, now seen corresponding path program 1 times [2019-09-08 03:41:52,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:52,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:52,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:52,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:52,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:52,415 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:41:52,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:52,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:41:52,416 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:41:52,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:41:52,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:41:52,417 INFO L87 Difference]: Start difference. First operand 6118 states and 9818 transitions. Second operand 4 states. [2019-09-08 03:41:53,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:53,676 INFO L93 Difference]: Finished difference Result 18047 states and 29443 transitions. [2019-09-08 03:41:53,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:41:53,678 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 189 [2019-09-08 03:41:53,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:53,767 INFO L225 Difference]: With dead ends: 18047 [2019-09-08 03:41:53,767 INFO L226 Difference]: Without dead ends: 11982 [2019-09-08 03:41:53,798 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:41:53,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11982 states. [2019-09-08 03:41:54,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11982 to 11979. [2019-09-08 03:41:54,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11979 states. [2019-09-08 03:41:54,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11979 states to 11979 states and 19325 transitions. [2019-09-08 03:41:54,531 INFO L78 Accepts]: Start accepts. Automaton has 11979 states and 19325 transitions. Word has length 189 [2019-09-08 03:41:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:54,532 INFO L475 AbstractCegarLoop]: Abstraction has 11979 states and 19325 transitions. [2019-09-08 03:41:54,532 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:41:54,532 INFO L276 IsEmpty]: Start isEmpty. Operand 11979 states and 19325 transitions. [2019-09-08 03:41:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2019-09-08 03:41:54,538 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:54,538 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 03:41:54,539 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:54,539 INFO L82 PathProgramCache]: Analyzing trace with hash 952692259, now seen corresponding path program 1 times [2019-09-08 03:41:54,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:54,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:54,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:54,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:54,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:54,659 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:41:54,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:54,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:41:54,660 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:41:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:41:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:41:54,660 INFO L87 Difference]: Start difference. First operand 11979 states and 19325 transitions. Second operand 4 states. [2019-09-08 03:41:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:41:56,845 INFO L93 Difference]: Finished difference Result 35679 states and 58628 transitions. [2019-09-08 03:41:56,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:41:56,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 190 [2019-09-08 03:41:56,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:41:57,033 INFO L225 Difference]: With dead ends: 35679 [2019-09-08 03:41:57,033 INFO L226 Difference]: Without dead ends: 23754 [2019-09-08 03:41:57,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:41:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23754 states. [2019-09-08 03:41:59,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23754 to 23751. [2019-09-08 03:41:59,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23751 states. [2019-09-08 03:41:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23751 states to 23751 states and 38756 transitions. [2019-09-08 03:41:59,204 INFO L78 Accepts]: Start accepts. Automaton has 23751 states and 38756 transitions. Word has length 190 [2019-09-08 03:41:59,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:41:59,205 INFO L475 AbstractCegarLoop]: Abstraction has 23751 states and 38756 transitions. [2019-09-08 03:41:59,205 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:41:59,205 INFO L276 IsEmpty]: Start isEmpty. Operand 23751 states and 38756 transitions. [2019-09-08 03:41:59,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-09-08 03:41:59,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:41:59,211 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:41:59,212 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:41:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:41:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1162920824, now seen corresponding path program 1 times [2019-09-08 03:41:59,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:41:59,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:41:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:59,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:41:59,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:41:59,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:41:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:41:59,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:41:59,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:41:59,353 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:41:59,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:41:59,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:41:59,354 INFO L87 Difference]: Start difference. First operand 23751 states and 38756 transitions. Second operand 4 states. [2019-09-08 03:42:01,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:01,796 INFO L93 Difference]: Finished difference Result 71043 states and 118453 transitions. [2019-09-08 03:42:01,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:01,802 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-09-08 03:42:01,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:02,117 INFO L225 Difference]: With dead ends: 71043 [2019-09-08 03:42:02,118 INFO L226 Difference]: Without dead ends: 47348 [2019-09-08 03:42:02,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47348 states. [2019-09-08 03:42:04,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47348 to 47345. [2019-09-08 03:42:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47345 states. [2019-09-08 03:42:04,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47345 states to 47345 states and 78661 transitions. [2019-09-08 03:42:04,368 INFO L78 Accepts]: Start accepts. Automaton has 47345 states and 78661 transitions. Word has length 191 [2019-09-08 03:42:04,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:04,368 INFO L475 AbstractCegarLoop]: Abstraction has 47345 states and 78661 transitions. [2019-09-08 03:42:04,368 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:04,368 INFO L276 IsEmpty]: Start isEmpty. Operand 47345 states and 78661 transitions. [2019-09-08 03:42:04,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-09-08 03:42:04,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:04,374 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:42:04,374 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:04,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:04,374 INFO L82 PathProgramCache]: Analyzing trace with hash 997952063, now seen corresponding path program 1 times [2019-09-08 03:42:04,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:04,375 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:04,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:04,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:04,499 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:42:04,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:04,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:04,500 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:04,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:04,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:04,501 INFO L87 Difference]: Start difference. First operand 47345 states and 78661 transitions. Second operand 4 states. [2019-09-08 03:42:09,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:09,532 INFO L93 Difference]: Finished difference Result 141871 states and 242120 transitions. [2019-09-08 03:42:09,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:09,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-09-08 03:42:09,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:10,077 INFO L225 Difference]: With dead ends: 141871 [2019-09-08 03:42:10,077 INFO L226 Difference]: Without dead ends: 94586 [2019-09-08 03:42:10,242 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:10,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94586 states. [2019-09-08 03:42:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94586 to 94583. [2019-09-08 03:42:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94583 states. [2019-09-08 03:42:14,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94583 states to 94583 states and 161462 transitions. [2019-09-08 03:42:14,521 INFO L78 Accepts]: Start accepts. Automaton has 94583 states and 161462 transitions. Word has length 192 [2019-09-08 03:42:14,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:14,521 INFO L475 AbstractCegarLoop]: Abstraction has 94583 states and 161462 transitions. [2019-09-08 03:42:14,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:14,522 INFO L276 IsEmpty]: Start isEmpty. Operand 94583 states and 161462 transitions. [2019-09-08 03:42:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:42:14,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:14,526 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:42:14,526 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:14,527 INFO L82 PathProgramCache]: Analyzing trace with hash 2086768084, now seen corresponding path program 1 times [2019-09-08 03:42:14,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:14,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:14,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:14,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:14,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:42:14,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:14,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:42:14,652 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:42:14,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:42:14,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:14,653 INFO L87 Difference]: Start difference. First operand 94583 states and 161462 transitions. Second operand 4 states. [2019-09-08 03:42:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:24,836 INFO L93 Difference]: Finished difference Result 283627 states and 501511 transitions. [2019-09-08 03:42:24,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:42:24,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 193 [2019-09-08 03:42:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:42:26,109 INFO L225 Difference]: With dead ends: 283627 [2019-09-08 03:42:26,110 INFO L226 Difference]: Without dead ends: 189112 [2019-09-08 03:42:26,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:42:26,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189112 states. [2019-09-08 03:42:43,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189112 to 189109. [2019-09-08 03:42:43,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189109 states. [2019-09-08 03:42:45,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189109 states to 189109 states and 336187 transitions. [2019-09-08 03:42:45,233 INFO L78 Accepts]: Start accepts. Automaton has 189109 states and 336187 transitions. Word has length 193 [2019-09-08 03:42:45,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:42:45,233 INFO L475 AbstractCegarLoop]: Abstraction has 189109 states and 336187 transitions. [2019-09-08 03:42:45,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:42:45,234 INFO L276 IsEmpty]: Start isEmpty. Operand 189109 states and 336187 transitions. [2019-09-08 03:42:45,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2019-09-08 03:42:45,239 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:42:45,239 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:42:45,239 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:42:45,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:42:45,239 INFO L82 PathProgramCache]: Analyzing trace with hash 416254515, now seen corresponding path program 1 times [2019-09-08 03:42:45,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:42:45,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:42:45,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:45,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:42:45,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:42:45,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:42:45,396 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-08 03:42:45,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:42:45,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:42:45,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:42:45,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:42:45,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:42:45,398 INFO L87 Difference]: Start difference. First operand 189109 states and 336187 transitions. Second operand 9 states. [2019-09-08 03:42:59,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:42:59,767 INFO L93 Difference]: Finished difference Result 381817 states and 677659 transitions. [2019-09-08 03:42:59,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 03:42:59,768 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 193 [2019-09-08 03:42:59,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:01,811 INFO L225 Difference]: With dead ends: 381817 [2019-09-08 03:43:01,811 INFO L226 Difference]: Without dead ends: 192792 [2019-09-08 03:43:02,569 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2019-09-08 03:43:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192792 states. [2019-09-08 03:43:12,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192792 to 190709. [2019-09-08 03:43:12,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190709 states. [2019-09-08 03:43:23,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190709 states to 190709 states and 338107 transitions. [2019-09-08 03:43:23,458 INFO L78 Accepts]: Start accepts. Automaton has 190709 states and 338107 transitions. Word has length 193 [2019-09-08 03:43:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:43:23,459 INFO L475 AbstractCegarLoop]: Abstraction has 190709 states and 338107 transitions. [2019-09-08 03:43:23,459 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:43:23,459 INFO L276 IsEmpty]: Start isEmpty. Operand 190709 states and 338107 transitions. [2019-09-08 03:43:23,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 03:43:23,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:43:23,468 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:43:23,468 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:43:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:43:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash -2033649945, now seen corresponding path program 1 times [2019-09-08 03:43:23,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:43:23,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:43:23,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:43:23,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:43:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:43:23,598 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 03:43:23,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:43:23,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 03:43:23,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 03:43:23,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 03:43:23,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:23,601 INFO L87 Difference]: Start difference. First operand 190709 states and 338107 transitions. Second operand 5 states. [2019-09-08 03:43:38,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:43:38,327 INFO L93 Difference]: Finished difference Result 382239 states and 676427 transitions. [2019-09-08 03:43:38,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 03:43:38,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 199 [2019-09-08 03:43:38,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:43:39,450 INFO L225 Difference]: With dead ends: 382239 [2019-09-08 03:43:39,451 INFO L226 Difference]: Without dead ends: 191614 [2019-09-08 03:43:40,282 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 03:43:41,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191614 states. [2019-09-08 03:43:59,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191614 to 190684. [2019-09-08 03:43:59,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190684 states. [2019-09-08 03:44:01,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190684 states to 190684 states and 338057 transitions. [2019-09-08 03:44:01,339 INFO L78 Accepts]: Start accepts. Automaton has 190684 states and 338057 transitions. Word has length 199 [2019-09-08 03:44:01,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:01,340 INFO L475 AbstractCegarLoop]: Abstraction has 190684 states and 338057 transitions. [2019-09-08 03:44:01,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 03:44:01,340 INFO L276 IsEmpty]: Start isEmpty. Operand 190684 states and 338057 transitions. [2019-09-08 03:44:01,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-09-08 03:44:01,346 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:01,347 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:44:01,347 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:01,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:01,347 INFO L82 PathProgramCache]: Analyzing trace with hash 812731640, now seen corresponding path program 1 times [2019-09-08 03:44:01,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:01,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:01,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:01,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:01,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 03:44:01,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:01,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:44:01,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:44:01,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:44:01,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:01,500 INFO L87 Difference]: Start difference. First operand 190684 states and 338057 transitions. Second operand 9 states. [2019-09-08 03:44:16,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:16,002 INFO L93 Difference]: Finished difference Result 386724 states and 685324 transitions. [2019-09-08 03:44:16,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:44:16,002 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 198 [2019-09-08 03:44:16,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:17,009 INFO L225 Difference]: With dead ends: 386724 [2019-09-08 03:44:17,009 INFO L226 Difference]: Without dead ends: 196124 [2019-09-08 03:44:18,633 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:18,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196124 states. [2019-09-08 03:44:38,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196124 to 194844. [2019-09-08 03:44:38,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194844 states. [2019-09-08 03:44:39,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194844 states to 194844 states and 344643 transitions. [2019-09-08 03:44:39,607 INFO L78 Accepts]: Start accepts. Automaton has 194844 states and 344643 transitions. Word has length 198 [2019-09-08 03:44:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:44:39,608 INFO L475 AbstractCegarLoop]: Abstraction has 194844 states and 344643 transitions. [2019-09-08 03:44:39,608 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:44:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 194844 states and 344643 transitions. [2019-09-08 03:44:39,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-09-08 03:44:39,613 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:44:39,613 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:44:39,613 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:44:39,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:44:39,614 INFO L82 PathProgramCache]: Analyzing trace with hash 506455913, now seen corresponding path program 1 times [2019-09-08 03:44:39,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:44:39,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:44:39,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:39,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:44:39,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:44:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:44:39,755 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-09-08 03:44:39,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:44:39,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:44:39,756 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:44:39,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:44:39,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:39,757 INFO L87 Difference]: Start difference. First operand 194844 states and 344643 transitions. Second operand 9 states. [2019-09-08 03:44:55,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:44:55,951 INFO L93 Difference]: Finished difference Result 393444 states and 694726 transitions. [2019-09-08 03:44:55,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 03:44:55,951 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 199 [2019-09-08 03:44:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:44:57,035 INFO L225 Difference]: With dead ends: 393444 [2019-09-08 03:44:57,035 INFO L226 Difference]: Without dead ends: 198684 [2019-09-08 03:44:58,523 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:44:58,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198684 states. [2019-09-08 03:45:17,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198684 to 195164. [2019-09-08 03:45:17,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195164 states. [2019-09-08 03:45:19,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195164 states to 195164 states and 344963 transitions. [2019-09-08 03:45:19,961 INFO L78 Accepts]: Start accepts. Automaton has 195164 states and 344963 transitions. Word has length 199 [2019-09-08 03:45:19,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:19,962 INFO L475 AbstractCegarLoop]: Abstraction has 195164 states and 344963 transitions. [2019-09-08 03:45:19,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:45:19,962 INFO L276 IsEmpty]: Start isEmpty. Operand 195164 states and 344963 transitions. [2019-09-08 03:45:19,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 03:45:19,966 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:19,967 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:19,967 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:19,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:19,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1706658759, now seen corresponding path program 1 times [2019-09-08 03:45:19,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:19,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:19,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:19,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:20,123 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 03:45:20,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:20,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 03:45:20,125 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:45:20,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:45:20,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:45:20,125 INFO L87 Difference]: Start difference. First operand 195164 states and 344963 transitions. Second operand 9 states. [2019-09-08 03:45:37,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:45:37,946 INFO L93 Difference]: Finished difference Result 391367 states and 691947 transitions. [2019-09-08 03:45:37,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 03:45:37,947 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 250 [2019-09-08 03:45:37,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:45:38,942 INFO L225 Difference]: With dead ends: 391367 [2019-09-08 03:45:38,942 INFO L226 Difference]: Without dead ends: 195967 [2019-09-08 03:45:39,730 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-09-08 03:45:39,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195967 states. [2019-09-08 03:45:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195967 to 195164. [2019-09-08 03:45:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195164 states. [2019-09-08 03:45:51,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195164 states to 195164 states and 344803 transitions. [2019-09-08 03:45:51,789 INFO L78 Accepts]: Start accepts. Automaton has 195164 states and 344803 transitions. Word has length 250 [2019-09-08 03:45:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:45:51,789 INFO L475 AbstractCegarLoop]: Abstraction has 195164 states and 344803 transitions. [2019-09-08 03:45:51,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 03:45:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 195164 states and 344803 transitions. [2019-09-08 03:45:51,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-09-08 03:45:51,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:45:51,794 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:45:51,794 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:45:51,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:45:51,794 INFO L82 PathProgramCache]: Analyzing trace with hash -60102686, now seen corresponding path program 1 times [2019-09-08 03:45:51,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:45:51,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:45:51,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:51,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:45:51,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:45:51,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:45:51,950 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-09-08 03:45:51,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 03:45:51,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 03:45:51,953 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 03:45:51,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 03:45:51,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:45:51,954 INFO L87 Difference]: Start difference. First operand 195164 states and 344803 transitions. Second operand 4 states. [2019-09-08 03:46:22,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:46:22,176 INFO L93 Difference]: Finished difference Result 681553 states and 1215819 transitions. [2019-09-08 03:46:22,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 03:46:22,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-09-08 03:46:22,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:46:26,020 INFO L225 Difference]: With dead ends: 681553 [2019-09-08 03:46:26,020 INFO L226 Difference]: Without dead ends: 486153 [2019-09-08 03:46:28,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 03:46:28,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486153 states. [2019-09-08 03:47:12,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486153 to 484547. [2019-09-08 03:47:12,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484547 states. [2019-09-08 03:47:30,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484547 states to 484547 states and 852097 transitions. [2019-09-08 03:47:30,982 INFO L78 Accepts]: Start accepts. Automaton has 484547 states and 852097 transitions. Word has length 208 [2019-09-08 03:47:30,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 03:47:30,983 INFO L475 AbstractCegarLoop]: Abstraction has 484547 states and 852097 transitions. [2019-09-08 03:47:30,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 03:47:30,983 INFO L276 IsEmpty]: Start isEmpty. Operand 484547 states and 852097 transitions. [2019-09-08 03:47:30,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 03:47:30,990 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 03:47:30,990 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 03:47:30,991 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 03:47:30,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 03:47:30,991 INFO L82 PathProgramCache]: Analyzing trace with hash -110719519, now seen corresponding path program 1 times [2019-09-08 03:47:30,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 03:47:30,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 03:47:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:30,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 03:47:30,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 03:47:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:31,118 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-09-08 03:47:31,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 03:47:31,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 03:47:31,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 03:47:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 03:47:31,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 2998 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 03:47:31,595 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 03:47:31,644 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-09-08 03:47:31,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 03:47:31,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-09-08 03:47:31,662 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 03:47:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 03:47:31,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 03:47:31,673 INFO L87 Difference]: Start difference. First operand 484547 states and 852097 transitions. Second operand 9 states. [2019-09-08 03:48:30,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 03:48:30,855 INFO L93 Difference]: Finished difference Result 980237 states and 1802358 transitions. [2019-09-08 03:48:30,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 03:48:30,856 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 203 [2019-09-08 03:48:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 03:48:35,019 INFO L225 Difference]: With dead ends: 980237 [2019-09-08 03:48:35,020 INFO L226 Difference]: Without dead ends: 495747 [2019-09-08 03:48:40,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-09-08 03:48:41,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495747 states. [2019-09-08 03:49:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495747 to 495747. [2019-09-08 03:49:20,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495747 states.