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_product20.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 11:54:05,154 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 11:54:05,156 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 11:54:05,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 11:54:05,171 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 11:54:05,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 11:54:05,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 11:54:05,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 11:54:05,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 11:54:05,188 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 11:54:05,189 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 11:54:05,194 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 11:54:05,194 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 11:54:05,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 11:54:05,198 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 11:54:05,200 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 11:54:05,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 11:54:05,201 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 11:54:05,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 11:54:05,205 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 11:54:05,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 11:54:05,207 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 11:54:05,208 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 11:54:05,209 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 11:54:05,211 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 11:54:05,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 11:54:05,212 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 11:54:05,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 11:54:05,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 11:54:05,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 11:54:05,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 11:54:05,217 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 11:54:05,218 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 11:54:05,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 11:54:05,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 11:54:05,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 11:54:05,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 11:54:05,224 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 11:54:05,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 11:54:05,226 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 11:54:05,229 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 11:54:05,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 11:54:05,252 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 11:54:05,252 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 11:54:05,255 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 11:54:05,255 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 11:54:05,255 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 11:54:05,255 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 11:54:05,255 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 11:54:05,256 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 11:54:05,256 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 11:54:05,256 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 11:54:05,257 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 11:54:05,257 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 11:54:05,258 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 11:54:05,258 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 11:54:05,258 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 11:54:05,258 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 11:54:05,259 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 11:54:05,259 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 11:54:05,259 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 11:54:05,259 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 11:54:05,259 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 11:54:05,260 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:54:05,260 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 11:54:05,260 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 11:54:05,260 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 11:54:05,261 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 11:54:05,261 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 11:54:05,261 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 11:54:05,261 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 11:54:05,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 11:54:05,323 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 11:54:05,328 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 11:54:05,331 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 11:54:05,332 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 11:54:05,332 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product20.cil.c [2019-10-02 11:54:05,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dab156ef/ec496b452a72418dadf72718cf82106a/FLAG73e4b5588 [2019-10-02 11:54:06,061 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 11:54:06,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product20.cil.c [2019-10-02 11:54:06,096 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dab156ef/ec496b452a72418dadf72718cf82106a/FLAG73e4b5588 [2019-10-02 11:54:06,263 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9dab156ef/ec496b452a72418dadf72718cf82106a [2019-10-02 11:54:06,273 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 11:54:06,274 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 11:54:06,275 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 11:54:06,276 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 11:54:06,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 11:54:06,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:54:06" (1/1) ... [2019-10-02 11:54:06,284 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58782538 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:06, skipping insertion in model container [2019-10-02 11:54:06,284 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:54:06" (1/1) ... [2019-10-02 11:54:06,292 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 11:54:06,382 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 11:54:07,061 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:54:07,077 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 11:54:07,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 11:54:07,276 INFO L192 MainTranslator]: Completed translation [2019-10-02 11:54:07,277 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07 WrapperNode [2019-10-02 11:54:07,277 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 11:54:07,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 11:54:07,280 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 11:54:07,280 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 11:54:07,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (1/1) ... [2019-10-02 11:54:07,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (1/1) ... [2019-10-02 11:54:07,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (1/1) ... [2019-10-02 11:54:07,327 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (1/1) ... [2019-10-02 11:54:07,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (1/1) ... [2019-10-02 11:54:07,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (1/1) ... [2019-10-02 11:54:07,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (1/1) ... [2019-10-02 11:54:07,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 11:54:07,513 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 11:54:07,513 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 11:54:07,513 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 11:54:07,514 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 11:54:07,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 11:54:07,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 11:54:07,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 11:54:07,605 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 11:54:07,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 11:54:07,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 11:54:07,606 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 11:54:07,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 11:54:07,607 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 11:54:07,607 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 11:54:07,607 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 11:54:07,608 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:54:07,608 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 11:54:07,608 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 11:54:07,609 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 11:54:07,610 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 11:54:07,612 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 11:54:07,612 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 11:54:07,612 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 11:54:07,612 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 11:54:07,613 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 11:54:07,613 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 11:54:07,613 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 11:54:07,613 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 11:54:07,614 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 11:54:07,614 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 11:54:07,614 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 11:54:07,614 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 11:54:07,614 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 11:54:07,614 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 11:54:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 11:54:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 11:54:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 11:54:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 11:54:07,615 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 11:54:07,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 11:54:07,616 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 11:54:07,616 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 11:54:07,616 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 11:54:07,616 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 11:54:07,616 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 11:54:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 11:54:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 11:54:07,617 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 11:54:07,618 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 11:54:07,618 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 11:54:07,618 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 11:54:07,618 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 11:54:07,618 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 11:54:07,619 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 11:54:07,619 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 11:54:07,619 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 11:54:07,619 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 11:54:07,619 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 11:54:07,619 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 11:54:07,620 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 11:54:07,620 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 11:54:07,620 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 11:54:07,620 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:54:07,620 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 11:54:07,620 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 11:54:07,621 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 11:54:07,621 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:54:07,621 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 11:54:07,621 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 11:54:07,621 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 11:54:07,622 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-02 11:54:07,622 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 11:54:07,623 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-02 11:54:07,623 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 11:54:07,623 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 11:54:07,623 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-02 11:54:07,624 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-02 11:54:07,624 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 11:54:07,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 11:54:07,625 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 11:54:07,625 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 11:54:07,625 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 11:54:07,626 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 11:54:07,626 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 11:54:07,626 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 11:54:07,626 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 11:54:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 11:54:07,627 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 11:54:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 11:54:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 11:54:07,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 11:54:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 11:54:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 11:54:07,629 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 11:54:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 11:54:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 11:54:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 11:54:07,630 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 11:54:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 11:54:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 11:54:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 11:54:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 11:54:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 11:54:07,631 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 11:54:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 11:54:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 11:54:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 11:54:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 11:54:07,632 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 11:54:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 11:54:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 11:54:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 11:54:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-02 11:54:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-02 11:54:07,633 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-02 11:54:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 11:54:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 11:54:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 11:54:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 11:54:07,634 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 11:54:07,635 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 11:54:07,635 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 11:54:07,635 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 11:54:07,635 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 11:54:07,636 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 11:54:07,636 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 11:54:07,636 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 11:54:07,637 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 11:54:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 11:54:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 11:54:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 11:54:07,638 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 11:54:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 11:54:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 11:54:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 11:54:07,639 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 11:54:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 11:54:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 11:54:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 11:54:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 11:54:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 11:54:07,640 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 11:54:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 11:54:07,641 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 11:54:07,644 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 11:54:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 11:54:07,645 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 11:54:07,646 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 11:54:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 11:54:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 11:54:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 11:54:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 11:54:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 11:54:07,652 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 11:54:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 11:54:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 11:54:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 11:54:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 11:54:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 11:54:07,653 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 11:54:07,654 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-02 11:54:07,654 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 11:54:07,654 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 11:54:07,654 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-02 11:54:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 11:54:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 11:54:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 11:54:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-02 11:54:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-02 11:54:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 11:54:07,656 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 11:54:07,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 11:54:07,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 11:54:10,100 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 11:54:10,101 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 11:54:10,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:54:10 BoogieIcfgContainer [2019-10-02 11:54:10,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 11:54:10,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 11:54:10,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 11:54:10,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 11:54:10,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:54:06" (1/3) ... [2019-10-02 11:54:10,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2205f7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:54:10, skipping insertion in model container [2019-10-02 11:54:10,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:54:07" (2/3) ... [2019-10-02 11:54:10,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2205f7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:54:10, skipping insertion in model container [2019-10-02 11:54:10,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:54:10" (3/3) ... [2019-10-02 11:54:10,113 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product20.cil.c [2019-10-02 11:54:10,123 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 11:54:10,138 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 11:54:10,155 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 11:54:10,210 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 11:54:10,211 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 11:54:10,211 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 11:54:10,211 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 11:54:10,211 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 11:54:10,211 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 11:54:10,211 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 11:54:10,211 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 11:54:10,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 11:54:10,256 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states. [2019-10-02 11:54:10,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-02 11:54:10,273 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:10,274 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:10,276 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:10,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:10,281 INFO L82 PathProgramCache]: Analyzing trace with hash -570931917, now seen corresponding path program 1 times [2019-10-02 11:54:10,283 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:10,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:10,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:10,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:10,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:10,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:10,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:10,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:10,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:10,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:10,892 INFO L87 Difference]: Start difference. First operand 751 states. Second operand 4 states. [2019-10-02 11:54:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:11,130 INFO L93 Difference]: Finished difference Result 1186 states and 1900 transitions. [2019-10-02 11:54:11,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:54:11,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-02 11:54:11,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:11,165 INFO L225 Difference]: With dead ends: 1186 [2019-10-02 11:54:11,166 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:54:11,179 INFO L640 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-10-02 11:54:11,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:54:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:54:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:54:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 941 transitions. [2019-10-02 11:54:11,318 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 941 transitions. Word has length 87 [2019-10-02 11:54:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:11,319 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 941 transitions. [2019-10-02 11:54:11,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 941 transitions. [2019-10-02 11:54:11,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 11:54:11,335 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:11,336 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:11,336 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:11,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:11,337 INFO L82 PathProgramCache]: Analyzing trace with hash 801065692, now seen corresponding path program 1 times [2019-10-02 11:54:11,337 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:11,337 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:11,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:11,546 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:11,547 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:11,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:11,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:11,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:11,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:11,551 INFO L87 Difference]: Start difference. First operand 596 states and 941 transitions. Second operand 4 states. [2019-10-02 11:54:11,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:11,664 INFO L93 Difference]: Finished difference Result 1159 states and 1843 transitions. [2019-10-02 11:54:11,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:11,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-02 11:54:11,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:11,670 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 11:54:11,670 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:54:11,674 INFO L640 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-10-02 11:54:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:54:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:54:11,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:54:11,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 940 transitions. [2019-10-02 11:54:11,710 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 940 transitions. Word has length 88 [2019-10-02 11:54:11,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:11,711 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 940 transitions. [2019-10-02 11:54:11,711 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:11,712 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 940 transitions. [2019-10-02 11:54:11,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 11:54:11,723 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:11,724 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:11,724 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:11,727 INFO L82 PathProgramCache]: Analyzing trace with hash 786966479, now seen corresponding path program 1 times [2019-10-02 11:54:11,727 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:11,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:11,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:11,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:11,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:11,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:11,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:11,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:11,918 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:11,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:11,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:11,920 INFO L87 Difference]: Start difference. First operand 596 states and 940 transitions. Second operand 4 states. [2019-10-02 11:54:11,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:11,999 INFO L93 Difference]: Finished difference Result 1159 states and 1842 transitions. [2019-10-02 11:54:11,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:12,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-02 11:54:12,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:12,009 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 11:54:12,009 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:54:12,012 INFO L640 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-10-02 11:54:12,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:54:12,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:54:12,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:54:12,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 939 transitions. [2019-10-02 11:54:12,051 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 939 transitions. Word has length 89 [2019-10-02 11:54:12,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:12,052 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 939 transitions. [2019-10-02 11:54:12,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:12,052 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 939 transitions. [2019-10-02 11:54:12,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 11:54:12,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:12,054 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:12,054 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:12,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:12,055 INFO L82 PathProgramCache]: Analyzing trace with hash 753538744, now seen corresponding path program 1 times [2019-10-02 11:54:12,055 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:12,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:12,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:12,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:12,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:12,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:12,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:12,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:12,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:12,281 INFO L87 Difference]: Start difference. First operand 596 states and 939 transitions. Second operand 4 states. [2019-10-02 11:54:12,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:12,363 INFO L93 Difference]: Finished difference Result 1159 states and 1841 transitions. [2019-10-02 11:54:12,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:12,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 11:54:12,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:12,370 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 11:54:12,370 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:54:12,375 INFO L640 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-10-02 11:54:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:54:12,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:54:12,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:54:12,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 938 transitions. [2019-10-02 11:54:12,402 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 938 transitions. Word has length 90 [2019-10-02 11:54:12,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:12,403 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 938 transitions. [2019-10-02 11:54:12,403 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:12,403 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 938 transitions. [2019-10-02 11:54:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 11:54:12,411 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:12,412 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:12,412 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:12,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:12,412 INFO L82 PathProgramCache]: Analyzing trace with hash 120926827, now seen corresponding path program 1 times [2019-10-02 11:54:12,413 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:12,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:12,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:12,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:12,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:12,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:12,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:12,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:12,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:12,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:12,556 INFO L87 Difference]: Start difference. First operand 596 states and 938 transitions. Second operand 4 states. [2019-10-02 11:54:12,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:12,624 INFO L93 Difference]: Finished difference Result 1159 states and 1840 transitions. [2019-10-02 11:54:12,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 11:54:12,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 11:54:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:12,639 INFO L225 Difference]: With dead ends: 1159 [2019-10-02 11:54:12,639 INFO L226 Difference]: Without dead ends: 596 [2019-10-02 11:54:12,643 INFO L640 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-10-02 11:54:12,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-02 11:54:12,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-02 11:54:12,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-02 11:54:12,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 937 transitions. [2019-10-02 11:54:12,668 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 937 transitions. Word has length 91 [2019-10-02 11:54:12,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:12,668 INFO L475 AbstractCegarLoop]: Abstraction has 596 states and 937 transitions. [2019-10-02 11:54:12,668 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:12,668 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 937 transitions. [2019-10-02 11:54:12,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 11:54:12,671 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:12,671 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:12,671 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:12,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1906525548, now seen corresponding path program 1 times [2019-10-02 11:54:12,672 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:12,672 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:12,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:12,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:12,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:12,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:12,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:12,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 11:54:12,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:54:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:54:12,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:54:12,905 INFO L87 Difference]: Start difference. First operand 596 states and 937 transitions. Second operand 10 states. [2019-10-02 11:54:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:13,102 INFO L93 Difference]: Finished difference Result 1164 states and 1847 transitions. [2019-10-02 11:54:13,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:54:13,102 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-02 11:54:13,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:13,113 INFO L225 Difference]: With dead ends: 1164 [2019-10-02 11:54:13,114 INFO L226 Difference]: Without dead ends: 605 [2019-10-02 11:54:13,119 INFO L640 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-10-02 11:54:13,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-10-02 11:54:13,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 603. [2019-10-02 11:54:13,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-02 11:54:13,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 947 transitions. [2019-10-02 11:54:13,156 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 947 transitions. Word has length 92 [2019-10-02 11:54:13,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:13,157 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 947 transitions. [2019-10-02 11:54:13,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:54:13,157 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 947 transitions. [2019-10-02 11:54:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 11:54:13,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:13,161 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:13,161 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:13,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1805613581, now seen corresponding path program 1 times [2019-10-02 11:54:13,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:13,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:13,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:13,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:13,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:13,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:13,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:13,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 11:54:13,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 11:54:13,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 11:54:13,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 11:54:13,366 INFO L87 Difference]: Start difference. First operand 603 states and 947 transitions. Second operand 4 states. [2019-10-02 11:54:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:13,435 INFO L93 Difference]: Finished difference Result 1165 states and 1848 transitions. [2019-10-02 11:54:13,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 11:54:13,436 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 11:54:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:13,441 INFO L225 Difference]: With dead ends: 1165 [2019-10-02 11:54:13,442 INFO L226 Difference]: Without dead ends: 599 [2019-10-02 11:54:13,445 INFO L640 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-10-02 11:54:13,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-10-02 11:54:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-10-02 11:54:13,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-10-02 11:54:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 940 transitions. [2019-10-02 11:54:13,467 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 940 transitions. Word has length 92 [2019-10-02 11:54:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:13,468 INFO L475 AbstractCegarLoop]: Abstraction has 599 states and 940 transitions. [2019-10-02 11:54:13,468 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 11:54:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 940 transitions. [2019-10-02 11:54:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 11:54:13,470 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:13,470 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:13,470 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:13,471 INFO L82 PathProgramCache]: Analyzing trace with hash -940394859, now seen corresponding path program 1 times [2019-10-02 11:54:13,471 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:13,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:13,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:13,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:13,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:13,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:13,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:13,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:13,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:13,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:13,593 INFO L87 Difference]: Start difference. First operand 599 states and 940 transitions. Second operand 6 states. [2019-10-02 11:54:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:14,007 INFO L93 Difference]: Finished difference Result 1178 states and 1872 transitions. [2019-10-02 11:54:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 11:54:14,008 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-02 11:54:14,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:14,017 INFO L225 Difference]: With dead ends: 1178 [2019-10-02 11:54:14,017 INFO L226 Difference]: Without dead ends: 607 [2019-10-02 11:54:14,021 INFO L640 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-10-02 11:54:14,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-10-02 11:54:14,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-10-02 11:54:14,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-02 11:54:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 941 transitions. [2019-10-02 11:54:14,056 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 941 transitions. Word has length 93 [2019-10-02 11:54:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:14,058 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 941 transitions. [2019-10-02 11:54:14,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 941 transitions. [2019-10-02 11:54:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 11:54:14,060 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:14,061 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:14,061 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:14,062 INFO L82 PathProgramCache]: Analyzing trace with hash 101605271, now seen corresponding path program 1 times [2019-10-02 11:54:14,062 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:14,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:14,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:14,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:14,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:14,241 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:14,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:14,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:14,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:14,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:14,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:14,243 INFO L87 Difference]: Start difference. First operand 604 states and 941 transitions. Second operand 6 states. [2019-10-02 11:54:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:14,472 INFO L93 Difference]: Finished difference Result 1141 states and 1787 transitions. [2019-10-02 11:54:14,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:14,473 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-02 11:54:14,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:14,479 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 11:54:14,479 INFO L226 Difference]: Without dead ends: 604 [2019-10-02 11:54:14,483 INFO L640 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-10-02 11:54:14,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-02 11:54:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-02 11:54:14,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-02 11:54:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 937 transitions. [2019-10-02 11:54:14,516 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 937 transitions. Word has length 94 [2019-10-02 11:54:14,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:14,516 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 937 transitions. [2019-10-02 11:54:14,516 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 937 transitions. [2019-10-02 11:54:14,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 11:54:14,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:14,519 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:14,519 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:14,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:14,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1301106266, now seen corresponding path program 1 times [2019-10-02 11:54:14,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:14,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:14,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:14,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:14,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:14,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:14,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:14,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:14,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:14,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:14,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:14,696 INFO L87 Difference]: Start difference. First operand 604 states and 937 transitions. Second operand 6 states. [2019-10-02 11:54:14,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:14,998 INFO L93 Difference]: Finished difference Result 1141 states and 1783 transitions. [2019-10-02 11:54:14,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:14,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 11:54:14,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:15,006 INFO L225 Difference]: With dead ends: 1141 [2019-10-02 11:54:15,007 INFO L226 Difference]: Without dead ends: 604 [2019-10-02 11:54:15,011 INFO L640 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-10-02 11:54:15,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2019-10-02 11:54:15,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 604. [2019-10-02 11:54:15,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-10-02 11:54:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 933 transitions. [2019-10-02 11:54:15,056 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 933 transitions. Word has length 95 [2019-10-02 11:54:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:15,057 INFO L475 AbstractCegarLoop]: Abstraction has 604 states and 933 transitions. [2019-10-02 11:54:15,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:15,057 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 933 transitions. [2019-10-02 11:54:15,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 11:54:15,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:15,059 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:15,060 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:15,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:15,060 INFO L82 PathProgramCache]: Analyzing trace with hash 405801690, now seen corresponding path program 1 times [2019-10-02 11:54:15,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:15,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:15,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:15,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:15,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:15,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:15,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 11:54:15,236 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 11:54:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 11:54:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 11:54:15,237 INFO L87 Difference]: Start difference. First operand 604 states and 933 transitions. Second operand 7 states. [2019-10-02 11:54:15,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:15,388 INFO L93 Difference]: Finished difference Result 1144 states and 1783 transitions. [2019-10-02 11:54:15,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 11:54:15,388 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 11:54:15,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:15,395 INFO L225 Difference]: With dead ends: 1144 [2019-10-02 11:54:15,395 INFO L226 Difference]: Without dead ends: 586 [2019-10-02 11:54:15,400 INFO L640 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-10-02 11:54:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-02 11:54:15,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 583. [2019-10-02 11:54:15,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-02 11:54:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 896 transitions. [2019-10-02 11:54:15,436 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 896 transitions. Word has length 95 [2019-10-02 11:54:15,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:15,436 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 896 transitions. [2019-10-02 11:54:15,436 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 11:54:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 896 transitions. [2019-10-02 11:54:15,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 11:54:15,439 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:15,439 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:15,440 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:15,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1206800516, now seen corresponding path program 1 times [2019-10-02 11:54:15,441 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:15,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:15,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:15,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:15,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:15,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:15,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:15,595 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:15,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:15,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:15,597 INFO L87 Difference]: Start difference. First operand 583 states and 896 transitions. Second operand 6 states. [2019-10-02 11:54:15,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:15,730 INFO L93 Difference]: Finished difference Result 1120 states and 1742 transitions. [2019-10-02 11:54:15,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:15,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 11:54:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:15,735 INFO L225 Difference]: With dead ends: 1120 [2019-10-02 11:54:15,735 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 11:54:15,738 INFO L640 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-10-02 11:54:15,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 11:54:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-02 11:54:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-02 11:54:15,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 895 transitions. [2019-10-02 11:54:15,763 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 895 transitions. Word has length 96 [2019-10-02 11:54:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:15,765 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 895 transitions. [2019-10-02 11:54:15,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 895 transitions. [2019-10-02 11:54:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 11:54:15,766 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:15,766 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:15,767 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1614735903, now seen corresponding path program 1 times [2019-10-02 11:54:15,768 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:15,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:15,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:15,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:15,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:15,883 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:15,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:15,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:15,884 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:15,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:15,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:15,885 INFO L87 Difference]: Start difference. First operand 583 states and 895 transitions. Second operand 6 states. [2019-10-02 11:54:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:16,057 INFO L93 Difference]: Finished difference Result 1120 states and 1741 transitions. [2019-10-02 11:54:16,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:16,058 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 11:54:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:16,064 INFO L225 Difference]: With dead ends: 1120 [2019-10-02 11:54:16,064 INFO L226 Difference]: Without dead ends: 583 [2019-10-02 11:54:16,069 INFO L640 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-10-02 11:54:16,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2019-10-02 11:54:16,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 583. [2019-10-02 11:54:16,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2019-10-02 11:54:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 894 transitions. [2019-10-02 11:54:16,112 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 894 transitions. Word has length 97 [2019-10-02 11:54:16,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:16,115 INFO L475 AbstractCegarLoop]: Abstraction has 583 states and 894 transitions. [2019-10-02 11:54:16,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:16,116 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 894 transitions. [2019-10-02 11:54:16,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 11:54:16,117 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:16,117 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:16,118 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:16,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:16,118 INFO L82 PathProgramCache]: Analyzing trace with hash 2145287009, now seen corresponding path program 1 times [2019-10-02 11:54:16,118 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:16,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:16,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:16,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:16,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:16,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:16,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 11:54:16,373 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:54:16,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:54:16,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:54:16,374 INFO L87 Difference]: Start difference. First operand 583 states and 894 transitions. Second operand 12 states. [2019-10-02 11:54:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:16,678 INFO L93 Difference]: Finished difference Result 1126 states and 1751 transitions. [2019-10-02 11:54:16,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-02 11:54:16,678 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-02 11:54:16,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:16,683 INFO L225 Difference]: With dead ends: 1126 [2019-10-02 11:54:16,683 INFO L226 Difference]: Without dead ends: 590 [2019-10-02 11:54:16,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 11:54:16,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-02 11:54:16,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 588. [2019-10-02 11:54:16,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 588 states. [2019-10-02 11:54:16,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 900 transitions. [2019-10-02 11:54:16,718 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 900 transitions. Word has length 98 [2019-10-02 11:54:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:16,719 INFO L475 AbstractCegarLoop]: Abstraction has 588 states and 900 transitions. [2019-10-02 11:54:16,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:54:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 900 transitions. [2019-10-02 11:54:16,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 11:54:16,720 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:16,720 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:16,721 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:16,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:16,721 INFO L82 PathProgramCache]: Analyzing trace with hash 657724894, now seen corresponding path program 1 times [2019-10-02 11:54:16,721 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:16,721 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:16,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:16,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:16,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:16,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:16,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:16,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:16,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:16,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:16,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:16,836 INFO L87 Difference]: Start difference. First operand 588 states and 900 transitions. Second operand 6 states. [2019-10-02 11:54:17,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:17,527 INFO L93 Difference]: Finished difference Result 1127 states and 1781 transitions. [2019-10-02 11:54:17,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:17,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-02 11:54:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:17,531 INFO L225 Difference]: With dead ends: 1127 [2019-10-02 11:54:17,532 INFO L226 Difference]: Without dead ends: 592 [2019-10-02 11:54:17,536 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-10-02 11:54:17,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2019-10-02 11:54:17,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-10-02 11:54:17,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 904 transitions. [2019-10-02 11:54:17,563 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 904 transitions. Word has length 99 [2019-10-02 11:54:17,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:17,563 INFO L475 AbstractCegarLoop]: Abstraction has 592 states and 904 transitions. [2019-10-02 11:54:17,563 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:17,564 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 904 transitions. [2019-10-02 11:54:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-02 11:54:17,565 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:17,565 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:17,565 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:17,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1162306209, now seen corresponding path program 1 times [2019-10-02 11:54:17,566 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:17,566 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:17,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:17,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:17,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:17,694 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:17,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:17,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:17,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:17,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:17,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:17,698 INFO L87 Difference]: Start difference. First operand 592 states and 904 transitions. Second operand 6 states. [2019-10-02 11:54:18,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:18,437 INFO L93 Difference]: Finished difference Result 1136 states and 1788 transitions. [2019-10-02 11:54:18,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:18,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2019-10-02 11:54:18,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:18,445 INFO L225 Difference]: With dead ends: 1136 [2019-10-02 11:54:18,445 INFO L226 Difference]: Without dead ends: 597 [2019-10-02 11:54:18,453 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:18,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-10-02 11:54:18,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-10-02 11:54:18,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-10-02 11:54:18,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 909 transitions. [2019-10-02 11:54:18,477 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 909 transitions. Word has length 100 [2019-10-02 11:54:18,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:18,478 INFO L475 AbstractCegarLoop]: Abstraction has 597 states and 909 transitions. [2019-10-02 11:54:18,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:18,478 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 909 transitions. [2019-10-02 11:54:18,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-02 11:54:18,480 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:18,480 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:18,480 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:18,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:18,481 INFO L82 PathProgramCache]: Analyzing trace with hash 2097760514, now seen corresponding path program 1 times [2019-10-02 11:54:18,481 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:18,481 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:18,485 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:18,485 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:18,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:18,614 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:18,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:18,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:18,615 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:18,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:18,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:18,616 INFO L87 Difference]: Start difference. First operand 597 states and 909 transitions. Second operand 6 states. [2019-10-02 11:54:19,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:19,301 INFO L93 Difference]: Finished difference Result 1147 states and 1797 transitions. [2019-10-02 11:54:19,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:19,302 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-10-02 11:54:19,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:19,308 INFO L225 Difference]: With dead ends: 1147 [2019-10-02 11:54:19,309 INFO L226 Difference]: Without dead ends: 603 [2019-10-02 11:54:19,313 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:19,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2019-10-02 11:54:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 603. [2019-10-02 11:54:19,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2019-10-02 11:54:19,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 915 transitions. [2019-10-02 11:54:19,345 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 915 transitions. Word has length 101 [2019-10-02 11:54:19,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:19,345 INFO L475 AbstractCegarLoop]: Abstraction has 603 states and 915 transitions. [2019-10-02 11:54:19,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 915 transitions. [2019-10-02 11:54:19,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-02 11:54:19,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:19,348 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:19,348 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:19,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:19,349 INFO L82 PathProgramCache]: Analyzing trace with hash -367897405, now seen corresponding path program 1 times [2019-10-02 11:54:19,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:19,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:19,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:19,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:19,511 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:19,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:19,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 11:54:19,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 11:54:19,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 11:54:19,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 11:54:19,513 INFO L87 Difference]: Start difference. First operand 603 states and 915 transitions. Second operand 6 states. [2019-10-02 11:54:20,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:20,127 INFO L93 Difference]: Finished difference Result 1160 states and 1808 transitions. [2019-10-02 11:54:20,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 11:54:20,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-10-02 11:54:20,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:20,133 INFO L225 Difference]: With dead ends: 1160 [2019-10-02 11:54:20,133 INFO L226 Difference]: Without dead ends: 610 [2019-10-02 11:54:20,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:20,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2019-10-02 11:54:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2019-10-02 11:54:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-02 11:54:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 922 transitions. [2019-10-02 11:54:20,161 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 922 transitions. Word has length 102 [2019-10-02 11:54:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:20,162 INFO L475 AbstractCegarLoop]: Abstraction has 610 states and 922 transitions. [2019-10-02 11:54:20,162 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 11:54:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 922 transitions. [2019-10-02 11:54:20,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-02 11:54:20,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:20,164 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:20,164 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:20,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:20,165 INFO L82 PathProgramCache]: Analyzing trace with hash 57607206, now seen corresponding path program 1 times [2019-10-02 11:54:20,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:20,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:20,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:20,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:20,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:20,306 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:20,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:20,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:54:20,307 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:54:20,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:54:20,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:20,308 INFO L87 Difference]: Start difference. First operand 610 states and 922 transitions. Second operand 9 states. [2019-10-02 11:54:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:26,632 INFO L93 Difference]: Finished difference Result 1804 states and 2810 transitions. [2019-10-02 11:54:26,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:54:26,633 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 103 [2019-10-02 11:54:26,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:26,646 INFO L225 Difference]: With dead ends: 1804 [2019-10-02 11:54:26,646 INFO L226 Difference]: Without dead ends: 1178 [2019-10-02 11:54:26,652 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2019-10-02 11:54:26,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-10-02 11:54:26,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1170. [2019-10-02 11:54:26,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2019-10-02 11:54:26,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1817 transitions. [2019-10-02 11:54:26,727 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1817 transitions. Word has length 103 [2019-10-02 11:54:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:26,728 INFO L475 AbstractCegarLoop]: Abstraction has 1170 states and 1817 transitions. [2019-10-02 11:54:26,728 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:54:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1817 transitions. [2019-10-02 11:54:26,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 11:54:26,730 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:26,731 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:26,731 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:26,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:26,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1752163743, now seen corresponding path program 1 times [2019-10-02 11:54:26,732 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:26,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:26,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:26,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:26,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:26,860 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 11:54:26,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 11:54:26,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 11:54:26,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:54:26,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:54:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:54:26,862 INFO L87 Difference]: Start difference. First operand 1170 states and 1817 transitions. Second operand 9 states. [2019-10-02 11:54:27,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:27,060 INFO L93 Difference]: Finished difference Result 2247 states and 3517 transitions. [2019-10-02 11:54:27,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:54:27,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2019-10-02 11:54:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:27,068 INFO L225 Difference]: With dead ends: 2247 [2019-10-02 11:54:27,069 INFO L226 Difference]: Without dead ends: 1065 [2019-10-02 11:54:27,075 INFO L640 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-10-02 11:54:27,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1065 states. [2019-10-02 11:54:27,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1065 to 1065. [2019-10-02 11:54:27,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1065 states. [2019-10-02 11:54:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1065 states to 1065 states and 1644 transitions. [2019-10-02 11:54:27,128 INFO L78 Accepts]: Start accepts. Automaton has 1065 states and 1644 transitions. Word has length 106 [2019-10-02 11:54:27,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:27,129 INFO L475 AbstractCegarLoop]: Abstraction has 1065 states and 1644 transitions. [2019-10-02 11:54:27,129 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:54:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1065 states and 1644 transitions. [2019-10-02 11:54:27,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 11:54:27,135 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:27,135 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:27,135 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:27,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:27,136 INFO L82 PathProgramCache]: Analyzing trace with hash -175364120, now seen corresponding path program 1 times [2019-10-02 11:54:27,136 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:27,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:27,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:27,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:27,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:27,356 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 38 proven. 42 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2019-10-02 11:54:27,357 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:27,357 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:54:27,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:28,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:28,057 INFO L256 TraceCheckSpWp]: Trace formula consists of 3894 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-02 11:54:28,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:28,402 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 103 proven. 54 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:54:28,422 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:54:28,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2019-10-02 11:54:28,426 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-02 11:54:28,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-02 11:54:28,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-10-02 11:54:28,427 INFO L87 Difference]: Start difference. First operand 1065 states and 1644 transitions. Second operand 17 states. [2019-10-02 11:54:44,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:54:44,169 INFO L93 Difference]: Finished difference Result 4460 states and 7048 transitions. [2019-10-02 11:54:44,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-02 11:54:44,170 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 226 [2019-10-02 11:54:44,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:54:44,206 INFO L225 Difference]: With dead ends: 4460 [2019-10-02 11:54:44,206 INFO L226 Difference]: Without dead ends: 3426 [2019-10-02 11:54:44,212 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=440, Invalid=1912, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 11:54:44,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2019-10-02 11:54:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 3220. [2019-10-02 11:54:44,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3220 states. [2019-10-02 11:54:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3220 states to 3220 states and 5075 transitions. [2019-10-02 11:54:44,383 INFO L78 Accepts]: Start accepts. Automaton has 3220 states and 5075 transitions. Word has length 226 [2019-10-02 11:54:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:54:44,384 INFO L475 AbstractCegarLoop]: Abstraction has 3220 states and 5075 transitions. [2019-10-02 11:54:44,384 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-02 11:54:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3220 states and 5075 transitions. [2019-10-02 11:54:44,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2019-10-02 11:54:44,406 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:54:44,406 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:54:44,407 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:54:44,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:54:44,407 INFO L82 PathProgramCache]: Analyzing trace with hash -242414661, now seen corresponding path program 1 times [2019-10-02 11:54:44,407 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:54:44,408 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:54:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:44,411 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:44,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:54:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:44,873 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 27 proven. 24 refuted. 0 times theorem prover too weak. 715 trivial. 0 not checked. [2019-10-02 11:54:44,874 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:54:44,874 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:54:45,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:54:46,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:54:46,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 5472 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:54:46,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:54:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 766 backedges. 179 proven. 20 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2019-10-02 11:54:46,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:54:46,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2019-10-02 11:54:46,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-02 11:54:46,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-02 11:54:46,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:54:46,527 INFO L87 Difference]: Start difference. First operand 3220 states and 5075 transitions. Second operand 18 states. [2019-10-02 11:55:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:00,038 INFO L93 Difference]: Finished difference Result 8560 states and 13149 transitions. [2019-10-02 11:55:00,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-02 11:55:00,040 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 480 [2019-10-02 11:55:00,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:00,080 INFO L225 Difference]: With dead ends: 8560 [2019-10-02 11:55:00,080 INFO L226 Difference]: Without dead ends: 5386 [2019-10-02 11:55:00,099 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 525 GetRequests, 487 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=1321, Unknown=0, NotChecked=0, Total=1560 [2019-10-02 11:55:00,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5386 states. [2019-10-02 11:55:00,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5386 to 5224. [2019-10-02 11:55:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5224 states. [2019-10-02 11:55:00,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 7793 transitions. [2019-10-02 11:55:00,400 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 7793 transitions. Word has length 480 [2019-10-02 11:55:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:00,401 INFO L475 AbstractCegarLoop]: Abstraction has 5224 states and 7793 transitions. [2019-10-02 11:55:00,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-02 11:55:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 7793 transitions. [2019-10-02 11:55:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 550 [2019-10-02 11:55:00,447 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:00,448 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:55:00,449 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:00,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1047970507, now seen corresponding path program 1 times [2019-10-02 11:55:00,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:00,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:00,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:00,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:00,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:01,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 30 proven. 101 refuted. 0 times theorem prover too weak. 1204 trivial. 0 not checked. [2019-10-02 11:55:01,102 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:01,102 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:01,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:02,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:02,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 6110 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:55:02,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:02,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 345 proven. 0 refuted. 0 times theorem prover too weak. 990 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (4)] Exception during sending of exit command (exit): Broken pipe [2019-10-02 11:55:02,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:02,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2019-10-02 11:55:02,570 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 11:55:02,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 11:55:02,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-02 11:55:02,579 INFO L87 Difference]: Start difference. First operand 5224 states and 7793 transitions. Second operand 13 states. [2019-10-02 11:55:11,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:11,610 INFO L93 Difference]: Finished difference Result 10614 states and 16178 transitions. [2019-10-02 11:55:11,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-02 11:55:11,611 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 549 [2019-10-02 11:55:11,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:11,647 INFO L225 Difference]: With dead ends: 10614 [2019-10-02 11:55:11,647 INFO L226 Difference]: Without dead ends: 5448 [2019-10-02 11:55:11,675 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 599 GetRequests, 570 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=142, Invalid=788, Unknown=0, NotChecked=0, Total=930 [2019-10-02 11:55:11,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5448 states. [2019-10-02 11:55:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5448 to 5386. [2019-10-02 11:55:12,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5386 states. [2019-10-02 11:55:12,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5386 states to 5386 states and 8099 transitions. [2019-10-02 11:55:12,037 INFO L78 Accepts]: Start accepts. Automaton has 5386 states and 8099 transitions. Word has length 549 [2019-10-02 11:55:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:12,038 INFO L475 AbstractCegarLoop]: Abstraction has 5386 states and 8099 transitions. [2019-10-02 11:55:12,038 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 11:55:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 5386 states and 8099 transitions. [2019-10-02 11:55:12,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2019-10-02 11:55:12,062 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:12,063 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 15, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:12,063 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:12,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:12,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1663790126, now seen corresponding path program 1 times [2019-10-02 11:55:12,064 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:12,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:12,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:12,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:12,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 32 proven. 87 refuted. 0 times theorem prover too weak. 1414 trivial. 0 not checked. [2019-10-02 11:55:12,492 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:12,492 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:12,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:13,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:13,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 6182 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:55:13,457 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:13,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1533 backedges. 488 proven. 0 refuted. 0 times theorem prover too weak. 1045 trivial. 0 not checked. [2019-10-02 11:55:13,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:13,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-02 11:55:13,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:55:13,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:55:13,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:55:13,839 INFO L87 Difference]: Start difference. First operand 5386 states and 8099 transitions. Second operand 11 states. [2019-10-02 11:55:18,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:18,562 INFO L93 Difference]: Finished difference Result 10950 states and 16810 transitions. [2019-10-02 11:55:18,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 11:55:18,563 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 582 [2019-10-02 11:55:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:18,632 INFO L225 Difference]: With dead ends: 10950 [2019-10-02 11:55:18,632 INFO L226 Difference]: Without dead ends: 5622 [2019-10-02 11:55:18,654 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 599 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2019-10-02 11:55:18,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5622 states. [2019-10-02 11:55:19,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5622 to 5582. [2019-10-02 11:55:19,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5582 states. [2019-10-02 11:55:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5582 states to 5582 states and 8445 transitions. [2019-10-02 11:55:19,341 INFO L78 Accepts]: Start accepts. Automaton has 5582 states and 8445 transitions. Word has length 582 [2019-10-02 11:55:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:19,342 INFO L475 AbstractCegarLoop]: Abstraction has 5582 states and 8445 transitions. [2019-10-02 11:55:19,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:55:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 5582 states and 8445 transitions. [2019-10-02 11:55:19,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2019-10-02 11:55:19,388 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:19,389 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 12, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:19,390 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:19,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:19,390 INFO L82 PathProgramCache]: Analyzing trace with hash -480433805, now seen corresponding path program 1 times [2019-10-02 11:55:19,391 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:19,391 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:19,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:19,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:19,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:20,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1623 backedges. 34 proven. 92 refuted. 0 times theorem prover too weak. 1497 trivial. 0 not checked. [2019-10-02 11:55:20,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:20,134 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:20,308 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:21,378 INFO L256 TraceCheckSpWp]: Trace formula consists of 6197 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:55:21,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:21,800 INFO L134 CoverageAnalysis]: Checked inductivity of 1623 backedges. 174 proven. 664 refuted. 0 times theorem prover too weak. 785 trivial. 0 not checked. [2019-10-02 11:55:21,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:55:21,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 11:55:21,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:55:21,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:55:21,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:55:21,812 INFO L87 Difference]: Start difference. First operand 5582 states and 8445 transitions. Second operand 15 states. [2019-10-02 11:55:39,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:39,163 INFO L93 Difference]: Finished difference Result 33977 states and 56266 transitions. [2019-10-02 11:55:39,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-10-02 11:55:39,169 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 597 [2019-10-02 11:55:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:39,346 INFO L225 Difference]: With dead ends: 33977 [2019-10-02 11:55:39,347 INFO L226 Difference]: Without dead ends: 28291 [2019-10-02 11:55:39,387 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 628 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=734, Invalid=3172, Unknown=0, NotChecked=0, Total=3906 [2019-10-02 11:55:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28291 states. [2019-10-02 11:55:41,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28291 to 25097. [2019-10-02 11:55:41,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25097 states. [2019-10-02 11:55:41,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25097 states to 25097 states and 38060 transitions. [2019-10-02 11:55:41,711 INFO L78 Accepts]: Start accepts. Automaton has 25097 states and 38060 transitions. Word has length 597 [2019-10-02 11:55:41,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:41,712 INFO L475 AbstractCegarLoop]: Abstraction has 25097 states and 38060 transitions. [2019-10-02 11:55:41,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:55:41,712 INFO L276 IsEmpty]: Start isEmpty. Operand 25097 states and 38060 transitions. [2019-10-02 11:55:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 616 [2019-10-02 11:55:41,740 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:41,740 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 12, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:41,741 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:41,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1472448535, now seen corresponding path program 1 times [2019-10-02 11:55:41,741 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:41,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:41,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:41,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:42,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 30 proven. 64 refuted. 0 times theorem prover too weak. 1526 trivial. 0 not checked. [2019-10-02 11:55:42,126 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:42,127 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:42,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:43,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 6257 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:55:43,076 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:55:43,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1620 backedges. 599 proven. 0 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2019-10-02 11:55:43,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:55:43,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2019-10-02 11:55:43,789 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 11:55:43,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 11:55:43,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 11:55:43,791 INFO L87 Difference]: Start difference. First operand 25097 states and 38060 transitions. Second operand 11 states. [2019-10-02 11:55:54,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:55:54,653 INFO L93 Difference]: Finished difference Result 67562 states and 110529 transitions. [2019-10-02 11:55:54,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-02 11:55:54,654 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 615 [2019-10-02 11:55:54,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:55:54,932 INFO L225 Difference]: With dead ends: 67562 [2019-10-02 11:55:54,932 INFO L226 Difference]: Without dead ends: 42457 [2019-10-02 11:55:55,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 656 GetRequests, 631 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2019-10-02 11:55:55,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42457 states. [2019-10-02 11:55:56,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42457 to 38894. [2019-10-02 11:55:56,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38894 states. [2019-10-02 11:55:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38894 states to 38894 states and 59283 transitions. [2019-10-02 11:55:57,006 INFO L78 Accepts]: Start accepts. Automaton has 38894 states and 59283 transitions. Word has length 615 [2019-10-02 11:55:57,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:55:57,006 INFO L475 AbstractCegarLoop]: Abstraction has 38894 states and 59283 transitions. [2019-10-02 11:55:57,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 11:55:57,007 INFO L276 IsEmpty]: Start isEmpty. Operand 38894 states and 59283 transitions. [2019-10-02 11:55:57,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2019-10-02 11:55:57,043 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:55:57,044 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 10, 10, 9, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:55:57,044 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:55:57,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:55:57,045 INFO L82 PathProgramCache]: Analyzing trace with hash -632890952, now seen corresponding path program 1 times [2019-10-02 11:55:57,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:55:57,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:55:57,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:57,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:57,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:55:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:57,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 29 proven. 40 refuted. 0 times theorem prover too weak. 1587 trivial. 0 not checked. [2019-10-02 11:55:57,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:55:57,426 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:55:57,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:55:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:55:58,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 6269 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:55:58,399 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:56:00,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1656 backedges. 686 proven. 0 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2019-10-02 11:56:00,231 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:56:00,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2019-10-02 11:56:00,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 11:56:00,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 11:56:00,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 11:56:00,235 INFO L87 Difference]: Start difference. First operand 38894 states and 59283 transitions. Second operand 9 states. [2019-10-02 11:56:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:01,803 INFO L93 Difference]: Finished difference Result 78439 states and 121459 transitions. [2019-10-02 11:56:01,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 11:56:01,803 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 624 [2019-10-02 11:56:01,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:02,047 INFO L225 Difference]: With dead ends: 78439 [2019-10-02 11:56:02,048 INFO L226 Difference]: Without dead ends: 40823 [2019-10-02 11:56:02,209 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 632 GetRequests, 624 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:56:02,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40823 states. [2019-10-02 11:56:03,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40823 to 40823. [2019-10-02 11:56:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40823 states. [2019-10-02 11:56:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40823 states to 40823 states and 62549 transitions. [2019-10-02 11:56:03,901 INFO L78 Accepts]: Start accepts. Automaton has 40823 states and 62549 transitions. Word has length 624 [2019-10-02 11:56:03,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:03,902 INFO L475 AbstractCegarLoop]: Abstraction has 40823 states and 62549 transitions. [2019-10-02 11:56:03,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 11:56:03,902 INFO L276 IsEmpty]: Start isEmpty. Operand 40823 states and 62549 transitions. [2019-10-02 11:56:03,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2019-10-02 11:56:03,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:03,931 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 15, 12, 10, 10, 9, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:56:03,932 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:03,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1563296679, now seen corresponding path program 1 times [2019-10-02 11:56:03,932 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:03,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:03,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:03,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:03,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:03,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:04,340 INFO L134 CoverageAnalysis]: Checked inductivity of 1674 backedges. 30 proven. 68 refuted. 0 times theorem prover too weak. 1576 trivial. 0 not checked. [2019-10-02 11:56:04,340 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:56:04,340 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:56:04,473 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:05,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:05,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 6275 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:56:05,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:56:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1674 backedges. 170 proven. 668 refuted. 0 times theorem prover too weak. 836 trivial. 0 not checked. [2019-10-02 11:56:05,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:56:05,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-10-02 11:56:05,839 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:56:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:56:05,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:56:05,839 INFO L87 Difference]: Start difference. First operand 40823 states and 62549 transitions. Second operand 15 states. [2019-10-02 11:56:26,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:26,900 INFO L93 Difference]: Finished difference Result 164209 states and 301369 transitions. [2019-10-02 11:56:26,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-10-02 11:56:26,900 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 633 [2019-10-02 11:56:26,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:27,613 INFO L225 Difference]: With dead ends: 164209 [2019-10-02 11:56:27,613 INFO L226 Difference]: Without dead ends: 122509 [2019-10-02 11:56:27,795 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 711 GetRequests, 659 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=546, Invalid=2316, Unknown=0, NotChecked=0, Total=2862 [2019-10-02 11:56:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122509 states. [2019-10-02 11:56:34,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122509 to 104681. [2019-10-02 11:56:34,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104681 states. [2019-10-02 11:56:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104681 states to 104681 states and 165997 transitions. [2019-10-02 11:56:35,387 INFO L78 Accepts]: Start accepts. Automaton has 104681 states and 165997 transitions. Word has length 633 [2019-10-02 11:56:35,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:56:35,388 INFO L475 AbstractCegarLoop]: Abstraction has 104681 states and 165997 transitions. [2019-10-02 11:56:35,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 11:56:35,388 INFO L276 IsEmpty]: Start isEmpty. Operand 104681 states and 165997 transitions. [2019-10-02 11:56:35,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 521 [2019-10-02 11:56:35,431 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:56:35,432 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:56:35,432 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:56:35,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:56:35,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1627088450, now seen corresponding path program 1 times [2019-10-02 11:56:35,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:56:35,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:56:35,435 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:35,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:35,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:56:35,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:35,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 35 proven. 132 refuted. 0 times theorem prover too weak. 1241 trivial. 0 not checked. [2019-10-02 11:56:35,858 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:56:35,858 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:56:35,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:56:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:56:36,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 5495 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 11:56:36,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:56:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1408 backedges. 786 proven. 0 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2019-10-02 11:56:36,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:56:36,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 12 [2019-10-02 11:56:36,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:56:36,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:56:36,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:56:36,835 INFO L87 Difference]: Start difference. First operand 104681 states and 165997 transitions. Second operand 12 states. [2019-10-02 11:56:58,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:56:58,030 INFO L93 Difference]: Finished difference Result 266918 states and 433641 transitions. [2019-10-02 11:56:58,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-02 11:56:58,030 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 520 [2019-10-02 11:56:58,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:56:58,849 INFO L225 Difference]: With dead ends: 266918 [2019-10-02 11:56:58,850 INFO L226 Difference]: Without dead ends: 162114 [2019-10-02 11:56:59,722 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 577 GetRequests, 542 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2019-10-02 11:56:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162114 states. [2019-10-02 11:57:08,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162114 to 159053. [2019-10-02 11:57:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159053 states. [2019-10-02 11:57:09,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159053 states to 159053 states and 249340 transitions. [2019-10-02 11:57:09,396 INFO L78 Accepts]: Start accepts. Automaton has 159053 states and 249340 transitions. Word has length 520 [2019-10-02 11:57:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:09,397 INFO L475 AbstractCegarLoop]: Abstraction has 159053 states and 249340 transitions. [2019-10-02 11:57:09,397 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:57:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 159053 states and 249340 transitions. [2019-10-02 11:57:09,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2019-10-02 11:57:09,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:09,468 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 12, 12, 12, 12, 12, 12, 12, 12, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:57:09,468 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:09,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:09,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1306296710, now seen corresponding path program 1 times [2019-10-02 11:57:09,469 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:09,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:09,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:09,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:09,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:09,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 28 proven. 74 refuted. 0 times theorem prover too weak. 1295 trivial. 0 not checked. [2019-10-02 11:57:09,756 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:09,756 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:09,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:10,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 5590 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 11:57:10,614 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:10,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1397 backedges. 842 proven. 120 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2019-10-02 11:57:10,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:57:10,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-10-02 11:57:10,781 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:57:10,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:57:10,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:57:10,781 INFO L87 Difference]: Start difference. First operand 159053 states and 249340 transitions. Second operand 12 states. [2019-10-02 11:57:32,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:32,002 INFO L93 Difference]: Finished difference Result 344281 states and 580256 transitions. [2019-10-02 11:57:32,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-10-02 11:57:32,003 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 546 [2019-10-02 11:57:32,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:32,798 INFO L225 Difference]: With dead ends: 344281 [2019-10-02 11:57:32,798 INFO L226 Difference]: Without dead ends: 185333 [2019-10-02 11:57:33,210 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 622 GetRequests, 574 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=422, Invalid=2028, Unknown=0, NotChecked=0, Total=2450 [2019-10-02 11:57:33,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185333 states. [2019-10-02 11:57:44,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185333 to 163861. [2019-10-02 11:57:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163861 states. [2019-10-02 11:57:45,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163861 states to 163861 states and 254766 transitions. [2019-10-02 11:57:45,553 INFO L78 Accepts]: Start accepts. Automaton has 163861 states and 254766 transitions. Word has length 546 [2019-10-02 11:57:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:57:45,554 INFO L475 AbstractCegarLoop]: Abstraction has 163861 states and 254766 transitions. [2019-10-02 11:57:45,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:57:45,555 INFO L276 IsEmpty]: Start isEmpty. Operand 163861 states and 254766 transitions. [2019-10-02 11:57:45,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2019-10-02 11:57:45,617 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:57:45,618 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 12, 12, 12, 12, 12, 12, 12, 12, 12, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-02 11:57:45,618 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:57:45,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:57:45,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1017924255, now seen corresponding path program 1 times [2019-10-02 11:57:45,619 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:57:45,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:57:45,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:45,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:45,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:57:45,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 28 proven. 33 refuted. 0 times theorem prover too weak. 1374 trivial. 0 not checked. [2019-10-02 11:57:46,014 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:57:46,014 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:57:46,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:57:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:57:46,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 5625 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 11:57:46,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:57:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1435 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 694 trivial. 0 not checked. [2019-10-02 11:57:47,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:57:47,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 12 [2019-10-02 11:57:47,787 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 11:57:47,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 11:57:47,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:57:47,787 INFO L87 Difference]: Start difference. First operand 163861 states and 254766 transitions. Second operand 12 states. [2019-10-02 11:57:57,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:57:57,941 INFO L93 Difference]: Finished difference Result 339756 states and 538919 transitions. [2019-10-02 11:57:57,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 11:57:57,941 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 555 [2019-10-02 11:57:57,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:57:58,646 INFO L225 Difference]: With dead ends: 339756 [2019-10-02 11:57:58,646 INFO L226 Difference]: Without dead ends: 176115 [2019-10-02 11:57:59,626 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 11:57:59,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176115 states. [2019-10-02 11:58:09,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176115 to 166970. [2019-10-02 11:58:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166970 states. [2019-10-02 11:58:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166970 states to 166970 states and 260164 transitions. [2019-10-02 11:58:10,785 INFO L78 Accepts]: Start accepts. Automaton has 166970 states and 260164 transitions. Word has length 555 [2019-10-02 11:58:10,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:10,786 INFO L475 AbstractCegarLoop]: Abstraction has 166970 states and 260164 transitions. [2019-10-02 11:58:10,786 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 11:58:10,786 INFO L276 IsEmpty]: Start isEmpty. Operand 166970 states and 260164 transitions. [2019-10-02 11:58:10,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2019-10-02 11:58:10,825 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:10,825 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 11, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:10,826 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:10,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:10,826 INFO L82 PathProgramCache]: Analyzing trace with hash -366257122, now seen corresponding path program 1 times [2019-10-02 11:58:10,826 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:10,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:10,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:10,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:10,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:11,105 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 28 proven. 30 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2019-10-02 11:58:11,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:11,106 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:11,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:11,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:11,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 5673 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-02 11:58:11,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 922 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2019-10-02 11:58:12,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 11:58:12,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2019-10-02 11:58:12,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 11:58:12,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 11:58:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 11:58:12,142 INFO L87 Difference]: Start difference. First operand 166970 states and 260164 transitions. Second operand 10 states. [2019-10-02 11:58:27,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:58:27,009 INFO L93 Difference]: Finished difference Result 349916 states and 557641 transitions. [2019-10-02 11:58:27,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 11:58:27,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 565 [2019-10-02 11:58:27,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:58:27,691 INFO L225 Difference]: With dead ends: 349916 [2019-10-02 11:58:27,692 INFO L226 Difference]: Without dead ends: 177127 [2019-10-02 11:58:28,092 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 585 GetRequests, 570 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-10-02 11:58:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177127 states. [2019-10-02 11:58:34,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177127 to 177068. [2019-10-02 11:58:34,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177068 states. [2019-10-02 11:58:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177068 states to 177068 states and 275828 transitions. [2019-10-02 11:58:35,499 INFO L78 Accepts]: Start accepts. Automaton has 177068 states and 275828 transitions. Word has length 565 [2019-10-02 11:58:35,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 11:58:35,500 INFO L475 AbstractCegarLoop]: Abstraction has 177068 states and 275828 transitions. [2019-10-02 11:58:35,500 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 11:58:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 177068 states and 275828 transitions. [2019-10-02 11:58:35,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2019-10-02 11:58:35,540 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 11:58:35,541 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 11, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 11:58:35,541 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 11:58:35,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 11:58:35,541 INFO L82 PathProgramCache]: Analyzing trace with hash -310262137, now seen corresponding path program 1 times [2019-10-02 11:58:35,541 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 11:58:35,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 11:58:35,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:35,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:35,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 11:58:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 30 proven. 38 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2019-10-02 11:58:36,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 11:58:36,712 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 11:58:36,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 11:58:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 11:58:37,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 5838 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 11:58:37,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 11:58:37,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1238 backedges. 523 proven. 167 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2019-10-02 11:58:37,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 11:58:37,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2019-10-02 11:58:37,876 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 11:58:37,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 11:58:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2019-10-02 11:58:37,877 INFO L87 Difference]: Start difference. First operand 177068 states and 275828 transitions. Second operand 15 states. [2019-10-02 11:59:35,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 11:59:35,064 INFO L93 Difference]: Finished difference Result 677792 states and 1159993 transitions. [2019-10-02 11:59:35,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-10-02 11:59:35,065 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 618 [2019-10-02 11:59:35,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 11:59:38,440 INFO L225 Difference]: With dead ends: 677792 [2019-10-02 11:59:38,441 INFO L226 Difference]: Without dead ends: 502186 [2019-10-02 11:59:39,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 725 GetRequests, 648 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=760, Invalid=5402, Unknown=0, NotChecked=0, Total=6162 [2019-10-02 11:59:39,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502186 states. [2019-10-02 12:00:23,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502186 to 456973. [2019-10-02 12:00:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456973 states. [2019-10-02 12:00:27,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456973 states to 456973 states and 721227 transitions. [2019-10-02 12:00:27,292 INFO L78 Accepts]: Start accepts. Automaton has 456973 states and 721227 transitions. Word has length 618 [2019-10-02 12:00:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:00:27,292 INFO L475 AbstractCegarLoop]: Abstraction has 456973 states and 721227 transitions. [2019-10-02 12:00:27,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 12:00:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 456973 states and 721227 transitions. [2019-10-02 12:00:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2019-10-02 12:00:27,344 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:00:27,345 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 13, 11, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:00:27,345 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:00:27,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:00:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 836410675, now seen corresponding path program 1 times [2019-10-02 12:00:27,345 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:00:27,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:00:27,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:27,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:27,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:00:27,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:27,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 38 proven. 29 refuted. 0 times theorem prover too weak. 1013 trivial. 0 not checked. [2019-10-02 12:00:27,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:00:27,814 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:00:27,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:00:29,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:00:29,616 INFO L256 TraceCheckSpWp]: Trace formula consists of 5727 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-02 12:00:29,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:00:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 673 proven. 5 refuted. 0 times theorem prover too weak. 402 trivial. 0 not checked. [2019-10-02 12:00:29,778 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:00:29,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-10-02 12:00:29,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:00:29,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:00:29,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:00:29,779 INFO L87 Difference]: Start difference. First operand 456973 states and 721227 transitions. Second operand 11 states. [2019-10-02 12:01:24,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:01:24,478 INFO L93 Difference]: Finished difference Result 920671 states and 1471101 transitions. [2019-10-02 12:01:24,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-10-02 12:01:24,479 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 584 [2019-10-02 12:01:24,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:01:28,048 INFO L225 Difference]: With dead ends: 920671 [2019-10-02 12:01:28,048 INFO L226 Difference]: Without dead ends: 462481 [2019-10-02 12:01:29,359 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 669 GetRequests, 609 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=452, Invalid=3208, Unknown=0, NotChecked=0, Total=3660 [2019-10-02 12:01:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462481 states. [2019-10-02 12:02:04,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462481 to 453882. [2019-10-02 12:02:04,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453882 states. [2019-10-02 12:02:06,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453882 states to 453882 states and 723216 transitions. [2019-10-02 12:02:06,993 INFO L78 Accepts]: Start accepts. Automaton has 453882 states and 723216 transitions. Word has length 584 [2019-10-02 12:02:06,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:02:06,994 INFO L475 AbstractCegarLoop]: Abstraction has 453882 states and 723216 transitions. [2019-10-02 12:02:06,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:02:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 453882 states and 723216 transitions. [2019-10-02 12:02:07,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 625 [2019-10-02 12:02:07,046 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:02:07,046 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 14, 12, 11, 11, 10, 10, 10, 10, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:02:07,047 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:02:07,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:02:07,047 INFO L82 PathProgramCache]: Analyzing trace with hash -993278044, now seen corresponding path program 1 times [2019-10-02 12:02:07,047 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:02:07,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:02:07,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:07,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:07,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:02:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:08,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 86 proven. 65 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-10-02 12:02:08,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 12:02:08,860 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 12:02:08,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:02:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:02:09,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 5856 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-02 12:02:09,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 12:02:10,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1277 backedges. 565 proven. 92 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2019-10-02 12:02:10,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 12:02:10,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2019-10-02 12:02:10,044 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:02:10,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:02:10,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:02:10,045 INFO L87 Difference]: Start difference. First operand 453882 states and 723216 transitions. Second operand 12 states. [2019-10-02 12:03:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:03:16,610 INFO L93 Difference]: Finished difference Result 1041614 states and 1764226 transitions. [2019-10-02 12:03:16,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-10-02 12:03:16,611 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 624 [2019-10-02 12:03:16,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:03:20,493 INFO L225 Difference]: With dead ends: 1041614 [2019-10-02 12:03:20,493 INFO L226 Difference]: Without dead ends: 584851 [2019-10-02 12:03:22,636 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 688 GetRequests, 641 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=343, Invalid=2009, Unknown=0, NotChecked=0, Total=2352 [2019-10-02 12:03:23,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584851 states. [2019-10-02 12:04:06,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584851 to 550491. [2019-10-02 12:04:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550491 states. [2019-10-02 12:04:11,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550491 states to 550491 states and 877629 transitions. [2019-10-02 12:04:11,853 INFO L78 Accepts]: Start accepts. Automaton has 550491 states and 877629 transitions. Word has length 624 [2019-10-02 12:04:11,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:04:11,853 INFO L475 AbstractCegarLoop]: Abstraction has 550491 states and 877629 transitions. [2019-10-02 12:04:11,853 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:04:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 550491 states and 877629 transitions. [2019-10-02 12:04:11,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2019-10-02 12:04:11,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:04:11,910 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 13, 11, 10, 10, 9, 9, 9, 9, 9, 9, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:04:11,911 INFO L418 AbstractCegarLoop]: === Iteration 36 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:04:11,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:04:11,911 INFO L82 PathProgramCache]: Analyzing trace with hash 538499976, now seen corresponding path program 1 times [2019-10-02 12:04:11,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:04:11,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:04:11,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:11,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:04:11,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:04:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat