java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 04:21:40,547 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 04:21:40,549 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 04:21:40,561 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 04:21:40,562 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 04:21:40,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 04:21:40,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 04:21:40,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 04:21:40,568 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 04:21:40,569 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 04:21:40,570 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 04:21:40,571 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 04:21:40,571 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 04:21:40,572 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 04:21:40,573 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 04:21:40,574 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 04:21:40,575 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 04:21:40,576 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 04:21:40,578 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 04:21:40,580 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 04:21:40,581 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 04:21:40,583 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 04:21:40,584 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 04:21:40,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 04:21:40,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 04:21:40,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 04:21:40,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 04:21:40,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 04:21:40,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 04:21:40,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 04:21:40,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 04:21:40,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 04:21:40,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 04:21:40,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 04:21:40,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 04:21:40,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 04:21:40,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 04:21:40,594 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 04:21:40,594 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 04:21:40,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 04:21:40,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 04:21:40,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 04:21:40,612 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 04:21:40,612 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 04:21:40,613 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 04:21:40,614 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 04:21:40,614 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 04:21:40,614 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 04:21:40,614 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 04:21:40,615 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 04:21:40,615 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 04:21:40,615 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 04:21:40,615 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 04:21:40,615 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 04:21:40,616 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 04:21:40,616 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 04:21:40,616 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 04:21:40,616 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 04:21:40,616 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 04:21:40,617 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 04:21:40,617 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 04:21:40,617 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 04:21:40,617 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 04:21:40,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:21:40,618 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 04:21:40,618 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 04:21:40,618 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 04:21:40,618 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 04:21:40,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 04:21:40,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 04:21:40,619 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 04:21:40,657 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 04:21:40,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 04:21:40,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 04:21:40,675 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 04:21:40,676 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 04:21:40,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-09-08 04:21:40,754 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52dd2509/af3a69a349684a2fa114f41a472a9777/FLAG84d1cd618 [2019-09-08 04:21:41,476 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 04:21:41,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product09.cil.c [2019-09-08 04:21:41,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52dd2509/af3a69a349684a2fa114f41a472a9777/FLAG84d1cd618 [2019-09-08 04:21:41,612 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a52dd2509/af3a69a349684a2fa114f41a472a9777 [2019-09-08 04:21:41,624 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 04:21:41,626 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 04:21:41,628 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 04:21:41,628 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 04:21:41,632 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 04:21:41,633 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:21:41" (1/1) ... [2019-09-08 04:21:41,636 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f7e5387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:41, skipping insertion in model container [2019-09-08 04:21:41,637 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 04:21:41" (1/1) ... [2019-09-08 04:21:41,645 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 04:21:41,736 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 04:21:42,546 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:21:42,572 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 04:21:42,704 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 04:21:42,767 INFO L192 MainTranslator]: Completed translation [2019-09-08 04:21:42,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42 WrapperNode [2019-09-08 04:21:42,768 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 04:21:42,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 04:21:42,769 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 04:21:42,769 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 04:21:42,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (1/1) ... [2019-09-08 04:21:42,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (1/1) ... [2019-09-08 04:21:42,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (1/1) ... [2019-09-08 04:21:42,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (1/1) ... [2019-09-08 04:21:42,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (1/1) ... [2019-09-08 04:21:42,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (1/1) ... [2019-09-08 04:21:42,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (1/1) ... [2019-09-08 04:21:42,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 04:21:42,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 04:21:42,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 04:21:42,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 04:21:42,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 04:21:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 04:21:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 04:21:43,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-09-08 04:21:43,044 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-09-08 04:21:43,045 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-09-08 04:21:43,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-09-08 04:21:43,045 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-09-08 04:21:43,045 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-09-08 04:21:43,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-09-08 04:21:43,046 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-09-08 04:21:43,046 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-09-08 04:21:43,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-09-08 04:21:43,047 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-09-08 04:21:43,047 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-09-08 04:21:43,048 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-09-08 04:21:43,048 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-09-08 04:21:43,051 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-09-08 04:21:43,051 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-09-08 04:21:43,051 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-09-08 04:21:43,052 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-09-08 04:21:43,052 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-09-08 04:21:43,052 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-09-08 04:21:43,052 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-09-08 04:21:43,052 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-09-08 04:21:43,053 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-09-08 04:21:43,053 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-09-08 04:21:43,053 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-09-08 04:21:43,053 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-09-08 04:21:43,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 04:21:43,053 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-09-08 04:21:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-09-08 04:21:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-09-08 04:21:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-09-08 04:21:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-09-08 04:21:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-09-08 04:21:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-09-08 04:21:43,054 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-09-08 04:21:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-09-08 04:21:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-09-08 04:21:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-09-08 04:21:43,055 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-09-08 04:21:43,056 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-09-08 04:21:43,056 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-09-08 04:21:43,056 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-09-08 04:21:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-09-08 04:21:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-09-08 04:21:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-09-08 04:21:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-09-08 04:21:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-09-08 04:21:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-09-08 04:21:43,057 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-09-08 04:21:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-09-08 04:21:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-09-08 04:21:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-09-08 04:21:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-09-08 04:21:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-09-08 04:21:43,058 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-09-08 04:21:43,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-09-08 04:21:43,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-09-08 04:21:43,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:21:43,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:21:43,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:21:43,059 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:21:43,060 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-09-08 04:21:43,060 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-09-08 04:21:43,060 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-09-08 04:21:43,060 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-09-08 04:21:43,061 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-09-08 04:21:43,061 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-09-08 04:21:43,061 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-09-08 04:21:43,061 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-09-08 04:21:43,062 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-09-08 04:21:43,062 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-09-08 04:21:43,062 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 04:21:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 04:21:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-09-08 04:21:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-09-08 04:21:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-09-08 04:21:43,063 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-09-08 04:21:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-09-08 04:21:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-09-08 04:21:43,064 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-09-08 04:21:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-09-08 04:21:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-09-08 04:21:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-09-08 04:21:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-09-08 04:21:43,065 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 04:21:43,066 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-09-08 04:21:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-09-08 04:21:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-09-08 04:21:43,067 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-09-08 04:21:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-09-08 04:21:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-09-08 04:21:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-09-08 04:21:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-09-08 04:21:43,068 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-09-08 04:21:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-09-08 04:21:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-09-08 04:21:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-09-08 04:21:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-09-08 04:21:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-09-08 04:21:43,069 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-09-08 04:21:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-09-08 04:21:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-09-08 04:21:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-09-08 04:21:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-09-08 04:21:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-09-08 04:21:43,070 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-09-08 04:21:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-09-08 04:21:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-09-08 04:21:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-09-08 04:21:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-09-08 04:21:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 04:21:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-09-08 04:21:43,071 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-09-08 04:21:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-09-08 04:21:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-09-08 04:21:43,072 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-09-08 04:21:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-09-08 04:21:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-09-08 04:21:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-09-08 04:21:43,073 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-09-08 04:21:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-09-08 04:21:43,074 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-09-08 04:21:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-09-08 04:21:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-09-08 04:21:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-09-08 04:21:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-09-08 04:21:43,075 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-09-08 04:21:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-09-08 04:21:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-09-08 04:21:43,076 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-09-08 04:21:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-09-08 04:21:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-09-08 04:21:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-09-08 04:21:43,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 04:21:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-09-08 04:21:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-09-08 04:21:43,078 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 04:21:43,079 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 04:21:43,083 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-09-08 04:21:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 04:21:43,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 04:21:43,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 04:21:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 04:21:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-09-08 04:21:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 04:21:43,093 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-09-08 04:21:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-09-08 04:21:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 04:21:43,094 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-09-08 04:21:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-09-08 04:21:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-09-08 04:21:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-09-08 04:21:43,095 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-09-08 04:21:43,096 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-09-08 04:21:43,096 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-09-08 04:21:43,096 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-09-08 04:21:43,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 04:21:43,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 04:21:43,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 04:21:45,657 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 04:21:45,657 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-09-08 04:21:45,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:21:45 BoogieIcfgContainer [2019-09-08 04:21:45,660 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 04:21:45,661 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 04:21:45,661 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 04:21:45,664 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 04:21:45,664 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 04:21:41" (1/3) ... [2019-09-08 04:21:45,665 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63779a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:21:45, skipping insertion in model container [2019-09-08 04:21:45,665 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 04:21:42" (2/3) ... [2019-09-08 04:21:45,666 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63779a91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 04:21:45, skipping insertion in model container [2019-09-08 04:21:45,666 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 04:21:45" (3/3) ... [2019-09-08 04:21:45,668 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product09.cil.c [2019-09-08 04:21:45,678 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 04:21:45,691 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 04:21:45,709 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 04:21:45,758 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 04:21:45,759 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 04:21:45,759 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 04:21:45,759 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 04:21:45,759 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 04:21:45,759 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 04:21:45,760 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 04:21:45,760 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 04:21:45,760 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 04:21:45,794 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states. [2019-09-08 04:21:45,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-08 04:21:45,816 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:45,818 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:45,820 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:45,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:45,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1110601002, now seen corresponding path program 1 times [2019-09-08 04:21:45,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:45,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:45,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:45,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:45,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:46,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:46,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:46,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:21:46,327 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:21:46,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:21:46,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:21:46,345 INFO L87 Difference]: Start difference. First operand 728 states. Second operand 4 states. [2019-09-08 04:21:46,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:46,539 INFO L93 Difference]: Finished difference Result 1119 states and 1831 transitions. [2019-09-08 04:21:46,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:21:46,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-09-08 04:21:46,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:46,583 INFO L225 Difference]: With dead ends: 1119 [2019-09-08 04:21:46,583 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 04:21:46,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:21:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 04:21:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-08 04:21:46,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 04:21:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 917 transitions. [2019-09-08 04:21:46,755 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 917 transitions. Word has length 109 [2019-09-08 04:21:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:46,756 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 917 transitions. [2019-09-08 04:21:46,756 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:21:46,756 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 917 transitions. [2019-09-08 04:21:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-08 04:21:46,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:46,765 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:46,765 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:46,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:46,766 INFO L82 PathProgramCache]: Analyzing trace with hash 513878495, now seen corresponding path program 1 times [2019-09-08 04:21:46,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:46,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:46,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:46,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:46,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:46,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:46,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:46,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:21:46,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:21:46,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:21:46,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:21:46,928 INFO L87 Difference]: Start difference. First operand 568 states and 917 transitions. Second operand 4 states. [2019-09-08 04:21:47,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:47,031 INFO L93 Difference]: Finished difference Result 1099 states and 1792 transitions. [2019-09-08 04:21:47,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:21:47,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-09-08 04:21:47,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:47,039 INFO L225 Difference]: With dead ends: 1099 [2019-09-08 04:21:47,039 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 04:21:47,043 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:21:47,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 04:21:47,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-08 04:21:47,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 04:21:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 916 transitions. [2019-09-08 04:21:47,091 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 916 transitions. Word has length 112 [2019-09-08 04:21:47,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:47,093 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 916 transitions. [2019-09-08 04:21:47,093 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:21:47,093 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 916 transitions. [2019-09-08 04:21:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-09-08 04:21:47,099 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:47,100 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:47,100 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:47,100 INFO L82 PathProgramCache]: Analyzing trace with hash -899322139, now seen corresponding path program 1 times [2019-09-08 04:21:47,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:47,102 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:47,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:47,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:47,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:47,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:47,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:47,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:47,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:21:47,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:21:47,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:21:47,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:21:47,356 INFO L87 Difference]: Start difference. First operand 568 states and 916 transitions. Second operand 4 states. [2019-09-08 04:21:47,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:47,451 INFO L93 Difference]: Finished difference Result 1099 states and 1791 transitions. [2019-09-08 04:21:47,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:21:47,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-09-08 04:21:47,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:47,459 INFO L225 Difference]: With dead ends: 1099 [2019-09-08 04:21:47,459 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 04:21:47,462 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:21:47,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 04:21:47,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-08 04:21:47,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 04:21:47,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 915 transitions. [2019-09-08 04:21:47,514 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 915 transitions. Word has length 113 [2019-09-08 04:21:47,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:47,514 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 915 transitions. [2019-09-08 04:21:47,515 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:21:47,515 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 915 transitions. [2019-09-08 04:21:47,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-08 04:21:47,519 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:47,520 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:47,520 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:47,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:47,520 INFO L82 PathProgramCache]: Analyzing trace with hash 251093531, now seen corresponding path program 1 times [2019-09-08 04:21:47,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:47,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:47,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:47,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:47,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:47,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:47,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:47,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:21:47,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:21:47,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:21:47,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:21:47,710 INFO L87 Difference]: Start difference. First operand 568 states and 915 transitions. Second operand 4 states. [2019-09-08 04:21:47,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:47,781 INFO L93 Difference]: Finished difference Result 1099 states and 1790 transitions. [2019-09-08 04:21:47,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:21:47,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-09-08 04:21:47,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:47,788 INFO L225 Difference]: With dead ends: 1099 [2019-09-08 04:21:47,788 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 04:21:47,791 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:21:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 04:21:47,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-08 04:21:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 04:21:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 914 transitions. [2019-09-08 04:21:47,821 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 914 transitions. Word has length 114 [2019-09-08 04:21:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:47,822 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 914 transitions. [2019-09-08 04:21:47,823 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:21:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 914 transitions. [2019-09-08 04:21:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 04:21:47,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:47,827 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:47,828 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:47,828 INFO L82 PathProgramCache]: Analyzing trace with hash -730763999, now seen corresponding path program 1 times [2019-09-08 04:21:47,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:47,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:47,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:47,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:47,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:47,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:48,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:48,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:48,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:21:48,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:21:48,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:21:48,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:21:48,016 INFO L87 Difference]: Start difference. First operand 568 states and 914 transitions. Second operand 4 states. [2019-09-08 04:21:48,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:48,076 INFO L93 Difference]: Finished difference Result 1099 states and 1789 transitions. [2019-09-08 04:21:48,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:21:48,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-08 04:21:48,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:48,082 INFO L225 Difference]: With dead ends: 1099 [2019-09-08 04:21:48,083 INFO L226 Difference]: Without dead ends: 568 [2019-09-08 04:21:48,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:21:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 568 states. [2019-09-08 04:21:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 568 to 568. [2019-09-08 04:21:48,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-09-08 04:21:48,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 913 transitions. [2019-09-08 04:21:48,110 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 913 transitions. Word has length 115 [2019-09-08 04:21:48,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:48,111 INFO L475 AbstractCegarLoop]: Abstraction has 568 states and 913 transitions. [2019-09-08 04:21:48,111 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:21:48,111 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 913 transitions. [2019-09-08 04:21:48,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 04:21:48,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:48,116 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:48,116 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:48,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:48,117 INFO L82 PathProgramCache]: Analyzing trace with hash 906386007, now seen corresponding path program 1 times [2019-09-08 04:21:48,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:48,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:48,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:48,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:48,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:48,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:48,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:21:48,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:21:48,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:21:48,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:21:48,343 INFO L87 Difference]: Start difference. First operand 568 states and 913 transitions. Second operand 10 states. [2019-09-08 04:21:48,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:48,523 INFO L93 Difference]: Finished difference Result 1057 states and 1709 transitions. [2019-09-08 04:21:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 04:21:48,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2019-09-08 04:21:48,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:48,529 INFO L225 Difference]: With dead ends: 1057 [2019-09-08 04:21:48,530 INFO L226 Difference]: Without dead ends: 577 [2019-09-08 04:21:48,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:21:48,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-09-08 04:21:48,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 575. [2019-09-08 04:21:48,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-09-08 04:21:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 922 transitions. [2019-09-08 04:21:48,572 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 922 transitions. Word has length 116 [2019-09-08 04:21:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:48,574 INFO L475 AbstractCegarLoop]: Abstraction has 575 states and 922 transitions. [2019-09-08 04:21:48,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:21:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 922 transitions. [2019-09-08 04:21:48,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 04:21:48,583 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:48,583 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:48,583 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:48,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:48,584 INFO L82 PathProgramCache]: Analyzing trace with hash 335134774, now seen corresponding path program 1 times [2019-09-08 04:21:48,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:48,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:48,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:48,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:48,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:48,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:48,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 04:21:48,749 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 04:21:48,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 04:21:48,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 04:21:48,751 INFO L87 Difference]: Start difference. First operand 575 states and 922 transitions. Second operand 4 states. [2019-09-08 04:21:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:48,811 INFO L93 Difference]: Finished difference Result 1105 states and 1795 transitions. [2019-09-08 04:21:48,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 04:21:48,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-08 04:21:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:48,818 INFO L225 Difference]: With dead ends: 1105 [2019-09-08 04:21:48,819 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 04:21:48,822 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:21:48,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 04:21:48,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 04:21:48,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 04:21:48,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 899 transitions. [2019-09-08 04:21:48,846 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 899 transitions. Word has length 116 [2019-09-08 04:21:48,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:48,847 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 899 transitions. [2019-09-08 04:21:48,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 04:21:48,847 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 899 transitions. [2019-09-08 04:21:48,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 04:21:48,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:48,852 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:48,852 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:48,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:48,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1313046375, now seen corresponding path program 1 times [2019-09-08 04:21:48,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:48,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:48,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:48,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:48,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:48,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:48,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:48,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:21:48,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:21:48,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:21:48,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:21:48,980 INFO L87 Difference]: Start difference. First operand 562 states and 899 transitions. Second operand 6 states. [2019-09-08 04:21:49,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:49,195 INFO L93 Difference]: Finished difference Result 1045 states and 1687 transitions. [2019-09-08 04:21:49,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:21:49,196 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-09-08 04:21:49,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:49,201 INFO L225 Difference]: With dead ends: 1045 [2019-09-08 04:21:49,201 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 04:21:49,204 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:21:49,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 04:21:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 04:21:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 04:21:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 895 transitions. [2019-09-08 04:21:49,225 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 895 transitions. Word has length 117 [2019-09-08 04:21:49,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:49,225 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 895 transitions. [2019-09-08 04:21:49,225 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:21:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 895 transitions. [2019-09-08 04:21:49,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 04:21:49,229 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:49,229 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:49,229 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:49,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:49,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1293617158, now seen corresponding path program 1 times [2019-09-08 04:21:49,230 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:49,230 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:49,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:49,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:49,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:49,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:49,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:21:49,365 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:21:49,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:21:49,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:21:49,366 INFO L87 Difference]: Start difference. First operand 562 states and 895 transitions. Second operand 6 states. [2019-09-08 04:21:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:49,617 INFO L93 Difference]: Finished difference Result 1045 states and 1683 transitions. [2019-09-08 04:21:49,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:21:49,617 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-08 04:21:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:49,622 INFO L225 Difference]: With dead ends: 1045 [2019-09-08 04:21:49,622 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 04:21:49,625 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:21:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 04:21:49,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 04:21:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 04:21:49,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 891 transitions. [2019-09-08 04:21:49,646 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 891 transitions. Word has length 118 [2019-09-08 04:21:49,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:49,646 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 891 transitions. [2019-09-08 04:21:49,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:21:49,646 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 891 transitions. [2019-09-08 04:21:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 04:21:49,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:49,652 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:49,652 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:49,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:49,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1173950530, now seen corresponding path program 1 times [2019-09-08 04:21:49,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:49,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:49,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:49,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:49,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:49,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:49,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:49,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:21:49,786 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:21:49,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:21:49,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:21:49,787 INFO L87 Difference]: Start difference. First operand 562 states and 891 transitions. Second operand 6 states. [2019-09-08 04:21:49,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:49,969 INFO L93 Difference]: Finished difference Result 1045 states and 1679 transitions. [2019-09-08 04:21:49,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:21:49,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-09-08 04:21:49,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:49,975 INFO L225 Difference]: With dead ends: 1045 [2019-09-08 04:21:49,975 INFO L226 Difference]: Without dead ends: 562 [2019-09-08 04:21:49,978 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:21:49,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2019-09-08 04:21:49,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2019-09-08 04:21:49,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2019-09-08 04:21:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 887 transitions. [2019-09-08 04:21:50,001 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 887 transitions. Word has length 119 [2019-09-08 04:21:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:50,001 INFO L475 AbstractCegarLoop]: Abstraction has 562 states and 887 transitions. [2019-09-08 04:21:50,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:21:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 887 transitions. [2019-09-08 04:21:50,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-09-08 04:21:50,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:50,007 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:50,007 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -2140246978, now seen corresponding path program 1 times [2019-09-08 04:21:50,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:50,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:50,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:50,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:50,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:50,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:50,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:50,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:21:50,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:21:50,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:21:50,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:21:50,165 INFO L87 Difference]: Start difference. First operand 562 states and 887 transitions. Second operand 7 states. [2019-09-08 04:21:50,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:50,260 INFO L93 Difference]: Finished difference Result 1045 states and 1675 transitions. [2019-09-08 04:21:50,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:21:50,261 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2019-09-08 04:21:50,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:50,265 INFO L225 Difference]: With dead ends: 1045 [2019-09-08 04:21:50,266 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 04:21:50,270 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:21:50,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 04:21:50,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-08 04:21:50,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-08 04:21:50,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 853 transitions. [2019-09-08 04:21:50,289 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 853 transitions. Word has length 119 [2019-09-08 04:21:50,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:50,290 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 853 transitions. [2019-09-08 04:21:50,290 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:21:50,290 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 853 transitions. [2019-09-08 04:21:50,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-08 04:21:50,293 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:50,294 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:50,294 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:50,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:50,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2053075839, now seen corresponding path program 1 times [2019-09-08 04:21:50,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:50,295 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:50,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:50,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:50,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:50,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:50,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:50,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:21:50,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:21:50,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:21:50,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:21:50,423 INFO L87 Difference]: Start difference. First operand 541 states and 853 transitions. Second operand 6 states. [2019-09-08 04:21:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:50,522 INFO L93 Difference]: Finished difference Result 1024 states and 1641 transitions. [2019-09-08 04:21:50,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:21:50,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-08 04:21:50,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:50,528 INFO L225 Difference]: With dead ends: 1024 [2019-09-08 04:21:50,528 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 04:21:50,532 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:21:50,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 04:21:50,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-08 04:21:50,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-08 04:21:50,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 852 transitions. [2019-09-08 04:21:50,612 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 852 transitions. Word has length 120 [2019-09-08 04:21:50,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:50,612 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 852 transitions. [2019-09-08 04:21:50,612 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:21:50,612 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 852 transitions. [2019-09-08 04:21:50,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 04:21:50,616 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:50,616 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:50,616 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:50,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:50,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1470960925, now seen corresponding path program 1 times [2019-09-08 04:21:50,617 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:50,617 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:50,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:50,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:50,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:50,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:50,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:50,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:21:50,733 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:21:50,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:21:50,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:21:50,734 INFO L87 Difference]: Start difference. First operand 541 states and 852 transitions. Second operand 6 states. [2019-09-08 04:21:50,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:50,826 INFO L93 Difference]: Finished difference Result 1024 states and 1640 transitions. [2019-09-08 04:21:50,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:21:50,827 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2019-09-08 04:21:50,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:50,831 INFO L225 Difference]: With dead ends: 1024 [2019-09-08 04:21:50,832 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 04:21:50,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:21:50,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 04:21:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-08 04:21:50,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-08 04:21:50,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 851 transitions. [2019-09-08 04:21:50,854 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 851 transitions. Word has length 121 [2019-09-08 04:21:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:50,855 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 851 transitions. [2019-09-08 04:21:50,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:21:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 851 transitions. [2019-09-08 04:21:50,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 04:21:50,859 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:50,859 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:50,859 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:50,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 470409988, now seen corresponding path program 1 times [2019-09-08 04:21:50,860 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:50,860 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:50,861 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:50,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:51,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:51,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:51,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 04:21:51,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 04:21:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 04:21:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-09-08 04:21:51,051 INFO L87 Difference]: Start difference. First operand 541 states and 851 transitions. Second operand 12 states. [2019-09-08 04:21:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:51,239 INFO L93 Difference]: Finished difference Result 1025 states and 1639 transitions. [2019-09-08 04:21:51,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 04:21:51,239 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 122 [2019-09-08 04:21:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:51,243 INFO L225 Difference]: With dead ends: 1025 [2019-09-08 04:21:51,244 INFO L226 Difference]: Without dead ends: 541 [2019-09-08 04:21:51,247 INFO L628 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-09-08 04:21:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2019-09-08 04:21:51,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2019-09-08 04:21:51,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2019-09-08 04:21:51,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 850 transitions. [2019-09-08 04:21:51,266 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 850 transitions. Word has length 122 [2019-09-08 04:21:51,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:51,267 INFO L475 AbstractCegarLoop]: Abstraction has 541 states and 850 transitions. [2019-09-08 04:21:51,267 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 04:21:51,267 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 850 transitions. [2019-09-08 04:21:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 04:21:51,273 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:51,273 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:51,274 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:51,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:51,274 INFO L82 PathProgramCache]: Analyzing trace with hash 213763234, now seen corresponding path program 1 times [2019-09-08 04:21:51,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:51,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:51,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:51,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:51,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:51,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:51,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:51,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 04:21:51,454 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 04:21:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 04:21:51,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 04:21:51,455 INFO L87 Difference]: Start difference. First operand 541 states and 850 transitions. Second operand 9 states. [2019-09-08 04:21:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:21:54,742 INFO L93 Difference]: Finished difference Result 1022 states and 1653 transitions. [2019-09-08 04:21:54,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 04:21:54,742 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 123 [2019-09-08 04:21:54,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:21:54,746 INFO L225 Difference]: With dead ends: 1022 [2019-09-08 04:21:54,747 INFO L226 Difference]: Without dead ends: 547 [2019-09-08 04:21:54,751 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-09-08 04:21:54,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2019-09-08 04:21:54,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 545. [2019-09-08 04:21:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-09-08 04:21:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 869 transitions. [2019-09-08 04:21:54,786 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 869 transitions. Word has length 123 [2019-09-08 04:21:54,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:21:54,787 INFO L475 AbstractCegarLoop]: Abstraction has 545 states and 869 transitions. [2019-09-08 04:21:54,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 04:21:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 869 transitions. [2019-09-08 04:21:54,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 04:21:54,793 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:21:54,793 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:21:54,793 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:21:54,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:21:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash 121735372, now seen corresponding path program 1 times [2019-09-08 04:21:54,794 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:21:54,794 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:21:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:54,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:21:54,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:21:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:21:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:21:54,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:21:54,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 04:21:54,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 04:21:54,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 04:21:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:21:54,971 INFO L87 Difference]: Start difference. First operand 545 states and 869 transitions. Second operand 8 states. [2019-09-08 04:22:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:00,770 INFO L93 Difference]: Finished difference Result 1906 states and 3168 transitions. [2019-09-08 04:22:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:22:00,771 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 124 [2019-09-08 04:22:00,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:00,782 INFO L225 Difference]: With dead ends: 1906 [2019-09-08 04:22:00,782 INFO L226 Difference]: Without dead ends: 1427 [2019-09-08 04:22:00,787 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-09-08 04:22:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2019-09-08 04:22:00,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1388. [2019-09-08 04:22:00,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1388 states. [2019-09-08 04:22:00,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 2236 transitions. [2019-09-08 04:22:00,856 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 2236 transitions. Word has length 124 [2019-09-08 04:22:00,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:00,857 INFO L475 AbstractCegarLoop]: Abstraction has 1388 states and 2236 transitions. [2019-09-08 04:22:00,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 04:22:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 2236 transitions. [2019-09-08 04:22:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 04:22:00,860 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:00,860 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:00,860 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:00,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1651184340, now seen corresponding path program 1 times [2019-09-08 04:22:00,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:00,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:00,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:00,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:00,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:00,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:22:00,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:00,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:22:00,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:22:00,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:22:00,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:22:00,997 INFO L87 Difference]: Start difference. First operand 1388 states and 2236 transitions. Second operand 7 states. [2019-09-08 04:22:04,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:04,948 INFO L93 Difference]: Finished difference Result 3556 states and 5866 transitions. [2019-09-08 04:22:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 04:22:04,948 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 130 [2019-09-08 04:22:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:04,971 INFO L225 Difference]: With dead ends: 3556 [2019-09-08 04:22:04,971 INFO L226 Difference]: Without dead ends: 2572 [2019-09-08 04:22:04,979 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:22:04,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2572 states. [2019-09-08 04:22:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2572 to 2516. [2019-09-08 04:22:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2516 states. [2019-09-08 04:22:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2516 states to 2516 states and 4112 transitions. [2019-09-08 04:22:05,148 INFO L78 Accepts]: Start accepts. Automaton has 2516 states and 4112 transitions. Word has length 130 [2019-09-08 04:22:05,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:05,149 INFO L475 AbstractCegarLoop]: Abstraction has 2516 states and 4112 transitions. [2019-09-08 04:22:05,149 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:22:05,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2516 states and 4112 transitions. [2019-09-08 04:22:05,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 04:22:05,153 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:05,153 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:05,154 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:05,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash -220068901, now seen corresponding path program 1 times [2019-09-08 04:22:05,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:05,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:05,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:05,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:05,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:05,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:22:05,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:05,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 04:22:05,274 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 04:22:05,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 04:22:05,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:22:05,275 INFO L87 Difference]: Start difference. First operand 2516 states and 4112 transitions. Second operand 5 states. [2019-09-08 04:22:05,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:05,400 INFO L93 Difference]: Finished difference Result 4632 states and 7632 transitions. [2019-09-08 04:22:05,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 04:22:05,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-08 04:22:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:05,425 INFO L225 Difference]: With dead ends: 4632 [2019-09-08 04:22:05,425 INFO L226 Difference]: Without dead ends: 2575 [2019-09-08 04:22:05,436 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 04:22:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-09-08 04:22:05,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2542. [2019-09-08 04:22:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-09-08 04:22:05,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4149 transitions. [2019-09-08 04:22:05,581 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4149 transitions. Word has length 135 [2019-09-08 04:22:05,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:05,581 INFO L475 AbstractCegarLoop]: Abstraction has 2542 states and 4149 transitions. [2019-09-08 04:22:05,581 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 04:22:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4149 transitions. [2019-09-08 04:22:05,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 04:22:05,586 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:05,586 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:05,586 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:05,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:05,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1523775240, now seen corresponding path program 1 times [2019-09-08 04:22:05,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:05,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:05,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:05,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:05,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:05,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 04:22:05,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:05,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:22:05,736 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:22:05,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:22:05,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:22:05,737 INFO L87 Difference]: Start difference. First operand 2542 states and 4149 transitions. Second operand 7 states. [2019-09-08 04:22:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:05,985 INFO L93 Difference]: Finished difference Result 4920 states and 8196 transitions. [2019-09-08 04:22:05,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 04:22:05,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 142 [2019-09-08 04:22:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:06,011 INFO L225 Difference]: With dead ends: 4920 [2019-09-08 04:22:06,012 INFO L226 Difference]: Without dead ends: 2542 [2019-09-08 04:22:06,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-09-08 04:22:06,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2019-09-08 04:22:06,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2019-09-08 04:22:06,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2542 states. [2019-09-08 04:22:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 4103 transitions. [2019-09-08 04:22:06,176 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 4103 transitions. Word has length 142 [2019-09-08 04:22:06,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:06,178 INFO L475 AbstractCegarLoop]: Abstraction has 2542 states and 4103 transitions. [2019-09-08 04:22:06,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:22:06,178 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 4103 transitions. [2019-09-08 04:22:06,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-09-08 04:22:06,182 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:06,183 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:06,183 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:06,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:06,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1238042262, now seen corresponding path program 1 times [2019-09-08 04:22:06,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:06,184 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:06,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:06,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:06,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:06,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-08 04:22:06,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:06,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 04:22:06,331 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 04:22:06,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 04:22:06,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 04:22:06,331 INFO L87 Difference]: Start difference. First operand 2542 states and 4103 transitions. Second operand 7 states. [2019-09-08 04:22:10,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:10,667 INFO L93 Difference]: Finished difference Result 4799 states and 7785 transitions. [2019-09-08 04:22:10,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 04:22:10,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 147 [2019-09-08 04:22:10,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:10,699 INFO L225 Difference]: With dead ends: 4799 [2019-09-08 04:22:10,699 INFO L226 Difference]: Without dead ends: 2725 [2019-09-08 04:22:10,715 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-08 04:22:10,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2019-09-08 04:22:11,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2658. [2019-09-08 04:22:11,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2658 states. [2019-09-08 04:22:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2658 states to 2658 states and 4259 transitions. [2019-09-08 04:22:11,064 INFO L78 Accepts]: Start accepts. Automaton has 2658 states and 4259 transitions. Word has length 147 [2019-09-08 04:22:11,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:11,065 INFO L475 AbstractCegarLoop]: Abstraction has 2658 states and 4259 transitions. [2019-09-08 04:22:11,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 04:22:11,066 INFO L276 IsEmpty]: Start isEmpty. Operand 2658 states and 4259 transitions. [2019-09-08 04:22:11,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 04:22:11,072 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:11,073 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:11,073 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:11,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:11,074 INFO L82 PathProgramCache]: Analyzing trace with hash 115535751, now seen corresponding path program 1 times [2019-09-08 04:22:11,074 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:11,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:11,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:11,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:11,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:11,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:22:11,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:11,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 04:22:11,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 04:22:11,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 04:22:11,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:22:11,273 INFO L87 Difference]: Start difference. First operand 2658 states and 4259 transitions. Second operand 6 states. [2019-09-08 04:22:11,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:11,579 INFO L93 Difference]: Finished difference Result 5948 states and 9653 transitions. [2019-09-08 04:22:11,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 04:22:11,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-08 04:22:11,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:11,636 INFO L225 Difference]: With dead ends: 5948 [2019-09-08 04:22:11,636 INFO L226 Difference]: Without dead ends: 3758 [2019-09-08 04:22:11,652 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 04:22:11,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3758 states. [2019-09-08 04:22:11,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3758 to 3524. [2019-09-08 04:22:11,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3524 states. [2019-09-08 04:22:11,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3524 states to 3524 states and 5688 transitions. [2019-09-08 04:22:11,920 INFO L78 Accepts]: Start accepts. Automaton has 3524 states and 5688 transitions. Word has length 152 [2019-09-08 04:22:11,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:11,920 INFO L475 AbstractCegarLoop]: Abstraction has 3524 states and 5688 transitions. [2019-09-08 04:22:11,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 04:22:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 3524 states and 5688 transitions. [2019-09-08 04:22:11,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 04:22:11,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:11,928 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:11,928 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:11,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:11,929 INFO L82 PathProgramCache]: Analyzing trace with hash 799851757, now seen corresponding path program 1 times [2019-09-08 04:22:11,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:11,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:11,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:11,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:11,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:11,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:12,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:22:12,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:12,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 04:22:12,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 04:22:12,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 04:22:12,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-09-08 04:22:12,205 INFO L87 Difference]: Start difference. First operand 3524 states and 5688 transitions. Second operand 11 states. [2019-09-08 04:22:19,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:19,665 INFO L93 Difference]: Finished difference Result 7497 states and 12120 transitions. [2019-09-08 04:22:19,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 04:22:19,671 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 154 [2019-09-08 04:22:19,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:19,693 INFO L225 Difference]: With dead ends: 7497 [2019-09-08 04:22:19,694 INFO L226 Difference]: Without dead ends: 4380 [2019-09-08 04:22:19,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-09-08 04:22:19,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4380 states. [2019-09-08 04:22:19,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4380 to 4110. [2019-09-08 04:22:19,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4110 states. [2019-09-08 04:22:19,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4110 states to 4110 states and 6545 transitions. [2019-09-08 04:22:19,877 INFO L78 Accepts]: Start accepts. Automaton has 4110 states and 6545 transitions. Word has length 154 [2019-09-08 04:22:19,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:19,877 INFO L475 AbstractCegarLoop]: Abstraction has 4110 states and 6545 transitions. [2019-09-08 04:22:19,878 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 04:22:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4110 states and 6545 transitions. [2019-09-08 04:22:19,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 04:22:19,882 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:19,882 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:19,882 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:19,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash 43149193, now seen corresponding path program 1 times [2019-09-08 04:22:19,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:19,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:19,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:19,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:19,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:19,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:22:20,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:20,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:22:20,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:22:20,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:22:20,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:22:20,051 INFO L87 Difference]: Start difference. First operand 4110 states and 6545 transitions. Second operand 10 states. [2019-09-08 04:22:25,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:25,777 INFO L93 Difference]: Finished difference Result 12799 states and 20985 transitions. [2019-09-08 04:22:25,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:22:25,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 152 [2019-09-08 04:22:25,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:25,835 INFO L225 Difference]: With dead ends: 12799 [2019-09-08 04:22:25,836 INFO L226 Difference]: Without dead ends: 8755 [2019-09-08 04:22:25,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:22:25,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8755 states. [2019-09-08 04:22:26,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8755 to 8659. [2019-09-08 04:22:26,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8659 states. [2019-09-08 04:22:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8659 states to 8659 states and 13902 transitions. [2019-09-08 04:22:26,381 INFO L78 Accepts]: Start accepts. Automaton has 8659 states and 13902 transitions. Word has length 152 [2019-09-08 04:22:26,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:26,381 INFO L475 AbstractCegarLoop]: Abstraction has 8659 states and 13902 transitions. [2019-09-08 04:22:26,381 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:22:26,382 INFO L276 IsEmpty]: Start isEmpty. Operand 8659 states and 13902 transitions. [2019-09-08 04:22:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 04:22:26,386 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:26,386 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:26,387 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:26,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:26,388 INFO L82 PathProgramCache]: Analyzing trace with hash 695519654, now seen corresponding path program 1 times [2019-09-08 04:22:26,388 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:26,388 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:26,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:26,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:26,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:22:26,566 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:26,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:22:26,566 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:22:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:22:26,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:22:26,570 INFO L87 Difference]: Start difference. First operand 8659 states and 13902 transitions. Second operand 10 states. [2019-09-08 04:22:32,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:32,816 INFO L93 Difference]: Finished difference Result 27520 states and 45514 transitions. [2019-09-08 04:22:32,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:22:32,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 155 [2019-09-08 04:22:32,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:32,941 INFO L225 Difference]: With dead ends: 27520 [2019-09-08 04:22:32,942 INFO L226 Difference]: Without dead ends: 18927 [2019-09-08 04:22:32,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:22:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18927 states. [2019-09-08 04:22:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18927 to 18754. [2019-09-08 04:22:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18754 states. [2019-09-08 04:22:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18754 states to 18754 states and 30516 transitions. [2019-09-08 04:22:34,002 INFO L78 Accepts]: Start accepts. Automaton has 18754 states and 30516 transitions. Word has length 155 [2019-09-08 04:22:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:34,002 INFO L475 AbstractCegarLoop]: Abstraction has 18754 states and 30516 transitions. [2019-09-08 04:22:34,002 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:22:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 18754 states and 30516 transitions. [2019-09-08 04:22:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 04:22:34,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:34,008 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:34,008 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 546174349, now seen corresponding path program 1 times [2019-09-08 04:22:34,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:34,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:34,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:34,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:34,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:34,154 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:22:34,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:34,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:22:34,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:22:34,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:22:34,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:22:34,156 INFO L87 Difference]: Start difference. First operand 18754 states and 30516 transitions. Second operand 10 states. [2019-09-08 04:22:41,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:41,536 INFO L93 Difference]: Finished difference Result 60762 states and 102317 transitions. [2019-09-08 04:22:41,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:22:41,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 154 [2019-09-08 04:22:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:41,812 INFO L225 Difference]: With dead ends: 60762 [2019-09-08 04:22:41,812 INFO L226 Difference]: Without dead ends: 42074 [2019-09-08 04:22:41,887 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:22:41,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42074 states. [2019-09-08 04:22:45,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42074 to 41747. [2019-09-08 04:22:45,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41747 states. [2019-09-08 04:22:45,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41747 states to 41747 states and 69296 transitions. [2019-09-08 04:22:45,342 INFO L78 Accepts]: Start accepts. Automaton has 41747 states and 69296 transitions. Word has length 154 [2019-09-08 04:22:45,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:22:45,342 INFO L475 AbstractCegarLoop]: Abstraction has 41747 states and 69296 transitions. [2019-09-08 04:22:45,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:22:45,342 INFO L276 IsEmpty]: Start isEmpty. Operand 41747 states and 69296 transitions. [2019-09-08 04:22:45,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 04:22:45,348 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:22:45,348 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:22:45,348 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:22:45,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:22:45,349 INFO L82 PathProgramCache]: Analyzing trace with hash 1692075242, now seen corresponding path program 1 times [2019-09-08 04:22:45,349 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:22:45,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:22:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:45,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:22:45,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:22:45,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:22:45,510 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:22:45,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:22:45,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:22:45,511 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:22:45,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:22:45,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:22:45,512 INFO L87 Difference]: Start difference. First operand 41747 states and 69296 transitions. Second operand 10 states. [2019-09-08 04:22:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:22:55,793 INFO L93 Difference]: Finished difference Result 138165 states and 239496 transitions. [2019-09-08 04:22:55,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:22:55,793 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 157 [2019-09-08 04:22:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:22:58,905 INFO L225 Difference]: With dead ends: 138165 [2019-09-08 04:22:58,905 INFO L226 Difference]: Without dead ends: 96484 [2019-09-08 04:22:59,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:22:59,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96484 states. [2019-09-08 04:23:03,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96484 to 95849. [2019-09-08 04:23:03,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95849 states. [2019-09-08 04:23:03,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95849 states to 95849 states and 163719 transitions. [2019-09-08 04:23:03,817 INFO L78 Accepts]: Start accepts. Automaton has 95849 states and 163719 transitions. Word has length 157 [2019-09-08 04:23:03,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:03,818 INFO L475 AbstractCegarLoop]: Abstraction has 95849 states and 163719 transitions. [2019-09-08 04:23:03,818 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:23:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 95849 states and 163719 transitions. [2019-09-08 04:23:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-09-08 04:23:03,825 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:03,825 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:03,826 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:03,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash 132494868, now seen corresponding path program 1 times [2019-09-08 04:23:03,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:03,826 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:03,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:03,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:03,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:03,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:04,006 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:23:04,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:04,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 04:23:04,007 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 04:23:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 04:23:04,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 04:23:04,008 INFO L87 Difference]: Start difference. First operand 95849 states and 163719 transitions. Second operand 10 states. [2019-09-08 04:23:27,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:23:27,092 INFO L93 Difference]: Finished difference Result 325394 states and 589287 transitions. [2019-09-08 04:23:27,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 04:23:27,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 158 [2019-09-08 04:23:27,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:23:28,869 INFO L225 Difference]: With dead ends: 325394 [2019-09-08 04:23:28,870 INFO L226 Difference]: Without dead ends: 229611 [2019-09-08 04:23:29,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2019-09-08 04:23:29,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229611 states. [2019-09-08 04:23:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229611 to 228360. [2019-09-08 04:23:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228360 states. [2019-09-08 04:23:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228360 states to 228360 states and 406447 transitions. [2019-09-08 04:23:52,170 INFO L78 Accepts]: Start accepts. Automaton has 228360 states and 406447 transitions. Word has length 158 [2019-09-08 04:23:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:23:52,170 INFO L475 AbstractCegarLoop]: Abstraction has 228360 states and 406447 transitions. [2019-09-08 04:23:52,171 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 04:23:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 228360 states and 406447 transitions. [2019-09-08 04:23:52,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 04:23:52,176 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:23:52,177 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:23:52,177 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:23:52,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:23:52,177 INFO L82 PathProgramCache]: Analyzing trace with hash 86898095, now seen corresponding path program 1 times [2019-09-08 04:23:52,177 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:23:52,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:23:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:52,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:23:52,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:23:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:23:52,277 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:23:52,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:23:52,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:23:52,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:23:52,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:23:52,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:23:52,278 INFO L87 Difference]: Start difference. First operand 228360 states and 406447 transitions. Second operand 3 states. [2019-09-08 04:24:30,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:24:30,965 INFO L93 Difference]: Finished difference Result 684937 states and 1297612 transitions. [2019-09-08 04:24:30,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:24:30,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 159 [2019-09-08 04:24:30,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:24:35,211 INFO L225 Difference]: With dead ends: 684937 [2019-09-08 04:24:35,211 INFO L226 Difference]: Without dead ends: 456643 [2019-09-08 04:24:37,065 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:24:37,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456643 states. [2019-09-08 04:25:37,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456643 to 456641. [2019-09-08 04:25:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456641 states. [2019-09-08 04:25:44,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456641 states to 456641 states and 871554 transitions. [2019-09-08 04:25:44,868 INFO L78 Accepts]: Start accepts. Automaton has 456641 states and 871554 transitions. Word has length 159 [2019-09-08 04:25:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 04:25:44,869 INFO L475 AbstractCegarLoop]: Abstraction has 456641 states and 871554 transitions. [2019-09-08 04:25:44,869 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 04:25:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 456641 states and 871554 transitions. [2019-09-08 04:25:44,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 04:25:44,879 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 04:25:44,879 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 04:25:44,879 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 04:25:44,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 04:25:44,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1602392625, now seen corresponding path program 1 times [2019-09-08 04:25:44,880 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 04:25:44,880 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 04:25:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:44,881 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 04:25:44,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 04:25:44,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 04:25:44,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 04:25:44,975 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 04:25:44,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 04:25:44,976 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 04:25:44,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 04:25:44,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 04:25:44,977 INFO L87 Difference]: Start difference. First operand 456641 states and 871554 transitions. Second operand 3 states. [2019-09-08 04:27:24,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 04:27:24,754 INFO L93 Difference]: Finished difference Result 1369782 states and 2872921 transitions. [2019-09-08 04:27:24,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 04:27:24,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 04:27:24,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 04:27:56,075 INFO L225 Difference]: With dead ends: 1369782 [2019-09-08 04:27:56,075 INFO L226 Difference]: Without dead ends: 913207