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_spec2_product18.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 12:15:05,709 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 12:15:05,711 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 12:15:05,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 12:15:05,723 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 12:15:05,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 12:15:05,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 12:15:05,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 12:15:05,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 12:15:05,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 12:15:05,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 12:15:05,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 12:15:05,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 12:15:05,733 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 12:15:05,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 12:15:05,735 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 12:15:05,736 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 12:15:05,737 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 12:15:05,739 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 12:15:05,741 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 12:15:05,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 12:15:05,744 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 12:15:05,745 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 12:15:05,746 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 12:15:05,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 12:15:05,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 12:15:05,749 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 12:15:05,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 12:15:05,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 12:15:05,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 12:15:05,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 12:15:05,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 12:15:05,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 12:15:05,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 12:15:05,757 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 12:15:05,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 12:15:05,758 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 12:15:05,758 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 12:15:05,759 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 12:15:05,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 12:15:05,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 12:15:05,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 12:15:05,786 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 12:15:05,787 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 12:15:05,788 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 12:15:05,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 12:15:05,789 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 12:15:05,789 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 12:15:05,789 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 12:15:05,789 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 12:15:05,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 12:15:05,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 12:15:05,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 12:15:05,790 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 12:15:05,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 12:15:05,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 12:15:05,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 12:15:05,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 12:15:05,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 12:15:05,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 12:15:05,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 12:15:05,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 12:15:05,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 12:15:05,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:15:05,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 12:15:05,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 12:15:05,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 12:15:05,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 12:15:05,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 12:15:05,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 12:15:05,794 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 12:15:05,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 12:15:05,841 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 12:15:05,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 12:15:05,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 12:15:05,846 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 12:15:05,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-10-02 12:15:05,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0ac868c/1a9c7662d3ab442bb6a0adc0a9f475c0/FLAG0f3bb1dfc [2019-10-02 12:15:06,582 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 12:15:06,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product18.cil.c [2019-10-02 12:15:06,611 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0ac868c/1a9c7662d3ab442bb6a0adc0a9f475c0/FLAG0f3bb1dfc [2019-10-02 12:15:06,829 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0ac868c/1a9c7662d3ab442bb6a0adc0a9f475c0 [2019-10-02 12:15:06,839 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 12:15:06,841 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 12:15:06,842 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 12:15:06,842 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 12:15:06,846 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 12:15:06,847 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:15:06" (1/1) ... [2019-10-02 12:15:06,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@537025f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:06, skipping insertion in model container [2019-10-02 12:15:06,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 12:15:06" (1/1) ... [2019-10-02 12:15:06,857 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 12:15:06,932 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 12:15:07,597 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:15:07,623 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 12:15:07,766 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 12:15:07,842 INFO L192 MainTranslator]: Completed translation [2019-10-02 12:15:07,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07 WrapperNode [2019-10-02 12:15:07,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 12:15:07,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 12:15:07,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 12:15:07,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 12:15:07,859 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (1/1) ... [2019-10-02 12:15:07,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (1/1) ... [2019-10-02 12:15:07,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (1/1) ... [2019-10-02 12:15:07,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (1/1) ... [2019-10-02 12:15:07,970 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (1/1) ... [2019-10-02 12:15:08,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (1/1) ... [2019-10-02 12:15:08,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (1/1) ... [2019-10-02 12:15:08,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 12:15:08,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 12:15:08,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 12:15:08,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 12:15:08,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 12:15:08,129 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 12:15:08,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 12:15:08,130 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-02 12:15:08,130 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-02 12:15:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-02 12:15:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-02 12:15:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-02 12:15:08,132 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-02 12:15:08,134 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-02 12:15:08,134 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-02 12:15:08,134 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-02 12:15:08,135 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-02 12:15:08,135 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-02 12:15:08,136 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-02 12:15:08,137 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-02 12:15:08,137 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-02 12:15:08,140 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-02 12:15:08,140 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-02 12:15:08,140 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-02 12:15:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-02 12:15:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-02 12:15:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-02 12:15:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-02 12:15:08,141 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-02 12:15:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-02 12:15:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-02 12:15:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-02 12:15:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-02 12:15:08,142 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-02 12:15:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-02 12:15:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-02 12:15:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-02 12:15:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-02 12:15:08,143 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-02 12:15:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-02 12:15:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__weight [2019-10-02 12:15:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-02 12:15:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__weight [2019-10-02 12:15:08,144 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-02 12:15:08,145 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-02 12:15:08,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-02 12:15:08,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-02 12:15:08,146 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-02 12:15:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-02 12:15:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-02 12:15:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-02 12:15:08,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-02 12:15:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-02 12:15:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-02 12:15:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-02 12:15:08,148 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-02 12:15:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-02 12:15:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-02 12:15:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-02 12:15:08,149 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-02 12:15:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-02 12:15:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-02 12:15:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-02 12:15:08,150 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-02 12:15:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-02 12:15:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-02 12:15:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-02 12:15:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-02 12:15:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 12:15:08,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:15:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:15:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:15:08,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:15:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-02 12:15:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-02 12:15:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-02 12:15:08,153 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-02 12:15:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-02 12:15:08,154 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-02 12:15:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-02 12:15:08,155 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-02 12:15:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 12:15:08,155 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 12:15:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-02 12:15:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-02 12:15:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-02 12:15:08,156 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-02 12:15:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-02 12:15:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-02 12:15:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-02 12:15:08,157 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-02 12:15:08,158 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-02 12:15:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-02 12:15:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-02 12:15:08,159 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-02 12:15:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-02 12:15:08,160 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-02 12:15:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-02 12:15:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-02 12:15:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-02 12:15:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-02 12:15:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-02 12:15:08,161 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-02 12:15:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-02 12:15:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-02 12:15:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-02 12:15:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-02 12:15:08,162 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-02 12:15:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-02 12:15:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-02 12:15:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-02 12:15:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-02 12:15:08,163 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-02 12:15:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-02 12:15:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-02 12:15:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-02 12:15:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-02 12:15:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-02 12:15:08,164 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-02 12:15:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-02 12:15:08,165 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-02 12:15:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-02 12:15:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-02 12:15:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-02 12:15:08,166 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-02 12:15:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-02 12:15:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-02 12:15:08,167 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-02 12:15:08,168 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__weight [2019-10-02 12:15:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-02 12:15:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__weight [2019-10-02 12:15:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 12:15:08,170 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-02 12:15:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-02 12:15:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-02 12:15:08,171 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 12:15:08,172 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 12:15:08,175 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-02 12:15:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 12:15:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 12:15:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 12:15:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 12:15:08,176 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-02 12:15:08,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 12:15:08,178 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-02 12:15:08,181 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-02 12:15:08,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 12:15:08,183 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-02 12:15:08,184 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-02 12:15:08,191 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-02 12:15:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-02 12:15:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-02 12:15:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-02 12:15:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-02 12:15:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-02 12:15:08,192 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-02 12:15:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-02 12:15:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-02 12:15:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-02 12:15:08,193 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-02 12:15:08,196 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-02 12:15:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-02 12:15:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-02 12:15:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-02 12:15:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-02 12:15:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-02 12:15:08,197 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-02 12:15:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 12:15:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-02 12:15:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 12:15:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 12:15:08,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 12:15:11,111 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 12:15:11,112 INFO L283 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-02 12:15:11,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:15:11 BoogieIcfgContainer [2019-10-02 12:15:11,114 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 12:15:11,115 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 12:15:11,115 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 12:15:11,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 12:15:11,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 12:15:06" (1/3) ... [2019-10-02 12:15:11,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b834c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:15:11, skipping insertion in model container [2019-10-02 12:15:11,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 12:15:07" (2/3) ... [2019-10-02 12:15:11,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b834c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 12:15:11, skipping insertion in model container [2019-10-02 12:15:11,121 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 12:15:11" (3/3) ... [2019-10-02 12:15:11,122 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product18.cil.c [2019-10-02 12:15:11,130 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 12:15:11,147 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 12:15:11,172 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 12:15:11,206 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 12:15:11,207 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 12:15:11,207 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 12:15:11,207 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 12:15:11,207 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 12:15:11,207 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 12:15:11,207 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 12:15:11,207 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 12:15:11,207 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 12:15:11,256 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states. [2019-10-02 12:15:11,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-02 12:15:11,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:11,272 INFO L411 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] [2019-10-02 12:15:11,276 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:11,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:11,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1188892362, now seen corresponding path program 1 times [2019-10-02 12:15:11,284 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:11,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:11,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:11,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:11,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:11,864 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:11,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:11,870 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:11,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:11,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:11,889 INFO L87 Difference]: Start difference. First operand 758 states. Second operand 4 states. [2019-10-02 12:15:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:12,151 INFO L93 Difference]: Finished difference Result 1165 states and 1897 transitions. [2019-10-02 12:15:12,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:15:12,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2019-10-02 12:15:12,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:12,180 INFO L225 Difference]: With dead ends: 1165 [2019-10-02 12:15:12,180 INFO L226 Difference]: Without dead ends: 591 [2019-10-02 12:15:12,192 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-02 12:15:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-02 12:15:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-02 12:15:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 950 transitions. [2019-10-02 12:15:12,314 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 950 transitions. Word has length 85 [2019-10-02 12:15:12,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:12,316 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 950 transitions. [2019-10-02 12:15:12,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:12,316 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 950 transitions. [2019-10-02 12:15:12,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-02 12:15:12,333 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:12,333 INFO L411 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] [2019-10-02 12:15:12,334 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:12,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:12,334 INFO L82 PathProgramCache]: Analyzing trace with hash -425590234, now seen corresponding path program 1 times [2019-10-02 12:15:12,335 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:12,335 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:12,341 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:12,341 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:12,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:12,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:12,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:12,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:12,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:12,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:12,613 INFO L87 Difference]: Start difference. First operand 591 states and 950 transitions. Second operand 4 states. [2019-10-02 12:15:12,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:12,706 INFO L93 Difference]: Finished difference Result 1145 states and 1858 transitions. [2019-10-02 12:15:12,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:15:12,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-02 12:15:12,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:12,715 INFO L225 Difference]: With dead ends: 1145 [2019-10-02 12:15:12,715 INFO L226 Difference]: Without dead ends: 591 [2019-10-02 12:15:12,720 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-02 12:15:12,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-02 12:15:12,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-02 12:15:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 949 transitions. [2019-10-02 12:15:12,788 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 949 transitions. Word has length 88 [2019-10-02 12:15:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:12,789 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 949 transitions. [2019-10-02 12:15:12,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 949 transitions. [2019-10-02 12:15:12,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-02 12:15:12,795 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:12,799 INFO L411 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] [2019-10-02 12:15:12,799 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:12,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:12,800 INFO L82 PathProgramCache]: Analyzing trace with hash -737262235, now seen corresponding path program 1 times [2019-10-02 12:15:12,800 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:12,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:12,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:12,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:12,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:12,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:12,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:12,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:12,965 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:12,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:12,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:12,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:12,966 INFO L87 Difference]: Start difference. First operand 591 states and 949 transitions. Second operand 4 states. [2019-10-02 12:15:13,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:13,045 INFO L93 Difference]: Finished difference Result 1145 states and 1857 transitions. [2019-10-02 12:15:13,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:15:13,045 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-02 12:15:13,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:13,052 INFO L225 Difference]: With dead ends: 1145 [2019-10-02 12:15:13,052 INFO L226 Difference]: Without dead ends: 591 [2019-10-02 12:15:13,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:13,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-02 12:15:13,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-02 12:15:13,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-02 12:15:13,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 948 transitions. [2019-10-02 12:15:13,090 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 948 transitions. Word has length 89 [2019-10-02 12:15:13,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:13,090 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 948 transitions. [2019-10-02 12:15:13,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:13,091 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 948 transitions. [2019-10-02 12:15:13,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-02 12:15:13,094 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:13,094 INFO L411 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] [2019-10-02 12:15:13,094 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:13,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:13,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1727810174, now seen corresponding path program 1 times [2019-10-02 12:15:13,095 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:13,095 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:13,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:13,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:13,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:13,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:13,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:13,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:13,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:13,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:13,303 INFO L87 Difference]: Start difference. First operand 591 states and 948 transitions. Second operand 4 states. [2019-10-02 12:15:13,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:13,383 INFO L93 Difference]: Finished difference Result 1145 states and 1856 transitions. [2019-10-02 12:15:13,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:15:13,384 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-02 12:15:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:13,391 INFO L225 Difference]: With dead ends: 1145 [2019-10-02 12:15:13,392 INFO L226 Difference]: Without dead ends: 591 [2019-10-02 12:15:13,395 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:13,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-02 12:15:13,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-02 12:15:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-02 12:15:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 947 transitions. [2019-10-02 12:15:13,428 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 947 transitions. Word has length 90 [2019-10-02 12:15:13,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:13,429 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 947 transitions. [2019-10-02 12:15:13,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:13,429 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 947 transitions. [2019-10-02 12:15:13,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-02 12:15:13,432 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:13,432 INFO L411 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] [2019-10-02 12:15:13,433 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:13,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:13,433 INFO L82 PathProgramCache]: Analyzing trace with hash 2006291585, now seen corresponding path program 1 times [2019-10-02 12:15:13,433 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:13,433 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:13,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:13,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:13,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:13,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:13,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:13,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:13,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:13,592 INFO L87 Difference]: Start difference. First operand 591 states and 947 transitions. Second operand 4 states. [2019-10-02 12:15:13,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:13,692 INFO L93 Difference]: Finished difference Result 1145 states and 1855 transitions. [2019-10-02 12:15:13,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:15:13,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-02 12:15:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:13,700 INFO L225 Difference]: With dead ends: 1145 [2019-10-02 12:15:13,701 INFO L226 Difference]: Without dead ends: 591 [2019-10-02 12:15:13,704 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-02 12:15:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 591. [2019-10-02 12:15:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 591 states. [2019-10-02 12:15:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 946 transitions. [2019-10-02 12:15:13,737 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 946 transitions. Word has length 91 [2019-10-02 12:15:13,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:13,738 INFO L475 AbstractCegarLoop]: Abstraction has 591 states and 946 transitions. [2019-10-02 12:15:13,738 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 946 transitions. [2019-10-02 12:15:13,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:15:13,744 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:13,744 INFO L411 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] [2019-10-02 12:15:13,744 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:13,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:13,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1880678622, now seen corresponding path program 1 times [2019-10-02 12:15:13,745 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:13,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:13,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:13,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:13,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:13,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:13,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 12:15:13,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 12:15:13,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 12:15:13,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 12:15:13,983 INFO L87 Difference]: Start difference. First operand 591 states and 946 transitions. Second operand 10 states. [2019-10-02 12:15:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:14,151 INFO L93 Difference]: Finished difference Result 1103 states and 1775 transitions. [2019-10-02 12:15:14,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 12:15:14,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-02 12:15:14,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:14,159 INFO L225 Difference]: With dead ends: 1103 [2019-10-02 12:15:14,159 INFO L226 Difference]: Without dead ends: 600 [2019-10-02 12:15:14,165 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:15:14,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2019-10-02 12:15:14,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 598. [2019-10-02 12:15:14,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-02 12:15:14,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 955 transitions. [2019-10-02 12:15:14,206 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 955 transitions. Word has length 92 [2019-10-02 12:15:14,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:14,208 INFO L475 AbstractCegarLoop]: Abstraction has 598 states and 955 transitions. [2019-10-02 12:15:14,209 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 12:15:14,209 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 955 transitions. [2019-10-02 12:15:14,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-02 12:15:14,213 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:14,213 INFO L411 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] [2019-10-02 12:15:14,213 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:14,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:14,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1901015997, now seen corresponding path program 1 times [2019-10-02 12:15:14,214 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:14,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:14,219 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:14,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:14,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:14,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:14,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:14,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:15:14,340 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:15:14,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:15:14,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:15:14,342 INFO L87 Difference]: Start difference. First operand 598 states and 955 transitions. Second operand 4 states. [2019-10-02 12:15:14,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:14,408 INFO L93 Difference]: Finished difference Result 1151 states and 1861 transitions. [2019-10-02 12:15:14,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 12:15:14,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-02 12:15:14,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:14,419 INFO L225 Difference]: With dead ends: 1151 [2019-10-02 12:15:14,419 INFO L226 Difference]: Without dead ends: 585 [2019-10-02 12:15:14,423 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:15:14,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-02 12:15:14,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-02 12:15:14,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-02 12:15:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 932 transitions. [2019-10-02 12:15:14,495 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 932 transitions. Word has length 92 [2019-10-02 12:15:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:14,496 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 932 transitions. [2019-10-02 12:15:14,496 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:15:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 932 transitions. [2019-10-02 12:15:14,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-02 12:15:14,499 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:14,500 INFO L411 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] [2019-10-02 12:15:14,500 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:14,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:14,500 INFO L82 PathProgramCache]: Analyzing trace with hash -1516088769, now seen corresponding path program 1 times [2019-10-02 12:15:14,501 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:14,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:14,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:14,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:14,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:14,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:14,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:15:14,674 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:15:14,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:15:14,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:15:14,675 INFO L87 Difference]: Start difference. First operand 585 states and 932 transitions. Second operand 6 states. [2019-10-02 12:15:14,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:14,943 INFO L93 Difference]: Finished difference Result 1091 states and 1753 transitions. [2019-10-02 12:15:14,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:15:14,944 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-02 12:15:14,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:14,949 INFO L225 Difference]: With dead ends: 1091 [2019-10-02 12:15:14,949 INFO L226 Difference]: Without dead ends: 585 [2019-10-02 12:15:14,953 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:14,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-02 12:15:14,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-02 12:15:14,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-02 12:15:14,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 928 transitions. [2019-10-02 12:15:14,975 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 928 transitions. Word has length 93 [2019-10-02 12:15:14,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:14,976 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 928 transitions. [2019-10-02 12:15:14,976 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 928 transitions. [2019-10-02 12:15:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-02 12:15:14,978 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:14,978 INFO L411 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] [2019-10-02 12:15:14,979 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:14,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:14,979 INFO L82 PathProgramCache]: Analyzing trace with hash 645733217, now seen corresponding path program 1 times [2019-10-02 12:15:14,979 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:14,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:14,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:14,984 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:14,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:15,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:15,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:15,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:15:15,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:15:15,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:15:15,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:15:15,179 INFO L87 Difference]: Start difference. First operand 585 states and 928 transitions. Second operand 6 states. [2019-10-02 12:15:15,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:15,409 INFO L93 Difference]: Finished difference Result 1091 states and 1749 transitions. [2019-10-02 12:15:15,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:15:15,410 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-02 12:15:15,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:15,416 INFO L225 Difference]: With dead ends: 1091 [2019-10-02 12:15:15,416 INFO L226 Difference]: Without dead ends: 585 [2019-10-02 12:15:15,420 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:15,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-02 12:15:15,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-02 12:15:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-02 12:15:15,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 924 transitions. [2019-10-02 12:15:15,453 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 924 transitions. Word has length 94 [2019-10-02 12:15:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:15,454 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 924 transitions. [2019-10-02 12:15:15,454 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:15,454 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 924 transitions. [2019-10-02 12:15:15,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:15:15,456 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:15,456 INFO L411 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] [2019-10-02 12:15:15,457 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:15,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:15,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1096058748, now seen corresponding path program 1 times [2019-10-02 12:15:15,457 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:15,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:15,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:15,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:15,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:15,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:15,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:15,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:15:15,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:15:15,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:15:15,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:15:15,623 INFO L87 Difference]: Start difference. First operand 585 states and 924 transitions. Second operand 6 states. [2019-10-02 12:15:15,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:15,910 INFO L93 Difference]: Finished difference Result 1091 states and 1745 transitions. [2019-10-02 12:15:15,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:15:15,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-02 12:15:15,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:15,917 INFO L225 Difference]: With dead ends: 1091 [2019-10-02 12:15:15,917 INFO L226 Difference]: Without dead ends: 585 [2019-10-02 12:15:15,920 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:15,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-02 12:15:15,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-02 12:15:15,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-02 12:15:15,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 920 transitions. [2019-10-02 12:15:15,944 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 920 transitions. Word has length 95 [2019-10-02 12:15:15,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:15,945 INFO L475 AbstractCegarLoop]: Abstraction has 585 states and 920 transitions. [2019-10-02 12:15:15,945 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:15,945 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 920 transitions. [2019-10-02 12:15:15,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-02 12:15:15,948 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:15,948 INFO L411 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] [2019-10-02 12:15:15,948 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:15,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:15,949 INFO L82 PathProgramCache]: Analyzing trace with hash -48204540, now seen corresponding path program 1 times [2019-10-02 12:15:15,949 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:15,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:15,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:15,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:15,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:16,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:16,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:16,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:15:16,101 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:15:16,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:15:16,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:15:16,101 INFO L87 Difference]: Start difference. First operand 585 states and 920 transitions. Second operand 7 states. [2019-10-02 12:15:16,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:16,191 INFO L93 Difference]: Finished difference Result 1091 states and 1741 transitions. [2019-10-02 12:15:16,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:15:16,192 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-02 12:15:16,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:16,197 INFO L225 Difference]: With dead ends: 1091 [2019-10-02 12:15:16,198 INFO L226 Difference]: Without dead ends: 564 [2019-10-02 12:15:16,202 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-02 12:15:16,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-02 12:15:16,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 12:15:16,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 886 transitions. [2019-10-02 12:15:16,221 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 886 transitions. Word has length 95 [2019-10-02 12:15:16,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:16,222 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 886 transitions. [2019-10-02 12:15:16,222 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:15:16,222 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 886 transitions. [2019-10-02 12:15:16,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-02 12:15:16,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:16,224 INFO L411 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] [2019-10-02 12:15:16,224 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:16,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:16,225 INFO L82 PathProgramCache]: Analyzing trace with hash 704168390, now seen corresponding path program 1 times [2019-10-02 12:15:16,225 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:16,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:16,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:16,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:16,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:16,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:16,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:16,358 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:16,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:15:16,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:15:16,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:15:16,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:15:16,359 INFO L87 Difference]: Start difference. First operand 564 states and 886 transitions. Second operand 6 states. [2019-10-02 12:15:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:16,454 INFO L93 Difference]: Finished difference Result 1070 states and 1707 transitions. [2019-10-02 12:15:16,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:15:16,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-02 12:15:16,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:16,459 INFO L225 Difference]: With dead ends: 1070 [2019-10-02 12:15:16,459 INFO L226 Difference]: Without dead ends: 564 [2019-10-02 12:15:16,462 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:16,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-02 12:15:16,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-02 12:15:16,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 12:15:16,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 885 transitions. [2019-10-02 12:15:16,485 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 885 transitions. Word has length 96 [2019-10-02 12:15:16,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:16,488 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 885 transitions. [2019-10-02 12:15:16,488 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 885 transitions. [2019-10-02 12:15:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-02 12:15:16,490 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:16,490 INFO L411 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] [2019-10-02 12:15:16,491 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash 637838025, now seen corresponding path program 1 times [2019-10-02 12:15:16,491 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:16,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:16,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:16,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:16,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:16,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:16,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:15:16,627 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:15:16,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:15:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:15:16,628 INFO L87 Difference]: Start difference. First operand 564 states and 885 transitions. Second operand 6 states. [2019-10-02 12:15:16,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:16,720 INFO L93 Difference]: Finished difference Result 1070 states and 1706 transitions. [2019-10-02 12:15:16,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:15:16,721 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-02 12:15:16,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:16,725 INFO L225 Difference]: With dead ends: 1070 [2019-10-02 12:15:16,725 INFO L226 Difference]: Without dead ends: 564 [2019-10-02 12:15:16,729 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-02 12:15:16,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-02 12:15:16,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 12:15:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 884 transitions. [2019-10-02 12:15:16,754 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 884 transitions. Word has length 97 [2019-10-02 12:15:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:16,755 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 884 transitions. [2019-10-02 12:15:16,755 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 884 transitions. [2019-10-02 12:15:16,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-02 12:15:16,757 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:16,757 INFO L411 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] [2019-10-02 12:15:16,758 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:16,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:16,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1457200085, now seen corresponding path program 1 times [2019-10-02 12:15:16,758 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:16,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:16,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:16,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:16,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:16,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:17,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:17,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:17,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:15:17,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:15:17,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:15:17,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:15:17,020 INFO L87 Difference]: Start difference. First operand 564 states and 884 transitions. Second operand 12 states. [2019-10-02 12:15:17,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:17,201 INFO L93 Difference]: Finished difference Result 1071 states and 1705 transitions. [2019-10-02 12:15:17,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-02 12:15:17,202 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-02 12:15:17,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:17,210 INFO L225 Difference]: With dead ends: 1071 [2019-10-02 12:15:17,210 INFO L226 Difference]: Without dead ends: 564 [2019-10-02 12:15:17,215 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-02 12:15:17,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-10-02 12:15:17,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 564. [2019-10-02 12:15:17,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 564 states. [2019-10-02 12:15:17,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 883 transitions. [2019-10-02 12:15:17,247 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 883 transitions. Word has length 98 [2019-10-02 12:15:17,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:17,248 INFO L475 AbstractCegarLoop]: Abstraction has 564 states and 883 transitions. [2019-10-02 12:15:17,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:15:17,248 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 883 transitions. [2019-10-02 12:15:17,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-02 12:15:17,250 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:17,250 INFO L411 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] [2019-10-02 12:15:17,251 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:17,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:17,251 INFO L82 PathProgramCache]: Analyzing trace with hash 910887794, now seen corresponding path program 1 times [2019-10-02 12:15:17,251 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:17,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:17,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:17,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:17,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:17,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-10-02 12:15:17,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:17,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:15:17,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:15:17,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:15:17,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:15:17,423 INFO L87 Difference]: Start difference. First operand 564 states and 883 transitions. Second operand 6 states. [2019-10-02 12:15:21,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:21,087 INFO L93 Difference]: Finished difference Result 1670 states and 2699 transitions. [2019-10-02 12:15:21,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:15:21,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-10-02 12:15:21,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:21,101 INFO L225 Difference]: With dead ends: 1670 [2019-10-02 12:15:21,101 INFO L226 Difference]: Without dead ends: 1172 [2019-10-02 12:15:21,105 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2019-10-02 12:15:21,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 1047. [2019-10-02 12:15:21,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1047 states. [2019-10-02 12:15:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1047 states to 1047 states and 1686 transitions. [2019-10-02 12:15:21,215 INFO L78 Accepts]: Start accepts. Automaton has 1047 states and 1686 transitions. Word has length 99 [2019-10-02 12:15:21,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:21,216 INFO L475 AbstractCegarLoop]: Abstraction has 1047 states and 1686 transitions. [2019-10-02 12:15:21,216 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:15:21,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1047 states and 1686 transitions. [2019-10-02 12:15:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-02 12:15:21,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:21,221 INFO L411 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] [2019-10-02 12:15:21,221 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:21,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:21,221 INFO L82 PathProgramCache]: Analyzing trace with hash 728641115, now seen corresponding path program 1 times [2019-10-02 12:15:21,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:21,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:21,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:21,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:21,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:21,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:21,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-02 12:15:21,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-02 12:15:21,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-02 12:15:21,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-10-02 12:15:21,418 INFO L87 Difference]: Start difference. First operand 1047 states and 1686 transitions. Second operand 12 states. [2019-10-02 12:15:31,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:31,657 INFO L93 Difference]: Finished difference Result 3352 states and 5434 transitions. [2019-10-02 12:15:31,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-02 12:15:31,657 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 131 [2019-10-02 12:15:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:31,674 INFO L225 Difference]: With dead ends: 3352 [2019-10-02 12:15:31,674 INFO L226 Difference]: Without dead ends: 2371 [2019-10-02 12:15:31,682 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=156, Invalid=836, Unknown=0, NotChecked=0, Total=992 [2019-10-02 12:15:31,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states. [2019-10-02 12:15:31,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 2313. [2019-10-02 12:15:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2313 states. [2019-10-02 12:15:31,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2313 states to 2313 states and 3713 transitions. [2019-10-02 12:15:31,799 INFO L78 Accepts]: Start accepts. Automaton has 2313 states and 3713 transitions. Word has length 131 [2019-10-02 12:15:31,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:31,799 INFO L475 AbstractCegarLoop]: Abstraction has 2313 states and 3713 transitions. [2019-10-02 12:15:31,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-02 12:15:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2313 states and 3713 transitions. [2019-10-02 12:15:31,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 12:15:31,804 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:31,804 INFO L411 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] [2019-10-02 12:15:31,805 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash 552853337, now seen corresponding path program 1 times [2019-10-02 12:15:31,805 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:31,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:31,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:31,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:31,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:31,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-10-02 12:15:31,995 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:31,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:15:31,996 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:15:31,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:15:31,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:31,997 INFO L87 Difference]: Start difference. First operand 2313 states and 3713 transitions. Second operand 9 states. [2019-10-02 12:15:35,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:35,973 INFO L93 Difference]: Finished difference Result 4600 states and 7543 transitions. [2019-10-02 12:15:35,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 12:15:35,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 132 [2019-10-02 12:15:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:35,992 INFO L225 Difference]: With dead ends: 4600 [2019-10-02 12:15:35,992 INFO L226 Difference]: Without dead ends: 2353 [2019-10-02 12:15:36,006 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 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-10-02 12:15:36,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2353 states. [2019-10-02 12:15:36,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2353 to 2337. [2019-10-02 12:15:36,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2337 states. [2019-10-02 12:15:36,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2337 states to 2337 states and 3797 transitions. [2019-10-02 12:15:36,141 INFO L78 Accepts]: Start accepts. Automaton has 2337 states and 3797 transitions. Word has length 132 [2019-10-02 12:15:36,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:36,142 INFO L475 AbstractCegarLoop]: Abstraction has 2337 states and 3797 transitions. [2019-10-02 12:15:36,142 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:15:36,142 INFO L276 IsEmpty]: Start isEmpty. Operand 2337 states and 3797 transitions. [2019-10-02 12:15:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 12:15:36,147 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:36,148 INFO L411 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] [2019-10-02 12:15:36,148 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:36,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash -2055663078, now seen corresponding path program 1 times [2019-10-02 12:15:36,149 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:36,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:36,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:36,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:36,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:36,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:36,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 12:15:36,321 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 12:15:36,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 12:15:36,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 12:15:36,322 INFO L87 Difference]: Start difference. First operand 2337 states and 3797 transitions. Second operand 8 states. [2019-10-02 12:15:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:42,703 INFO L93 Difference]: Finished difference Result 7919 states and 13290 transitions. [2019-10-02 12:15:42,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:15:42,703 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 133 [2019-10-02 12:15:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:42,741 INFO L225 Difference]: With dead ends: 7919 [2019-10-02 12:15:42,741 INFO L226 Difference]: Without dead ends: 5648 [2019-10-02 12:15:42,759 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 13 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-10-02 12:15:42,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5648 states. [2019-10-02 12:15:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5648 to 5600. [2019-10-02 12:15:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2019-10-02 12:15:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 8993 transitions. [2019-10-02 12:15:43,040 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 8993 transitions. Word has length 133 [2019-10-02 12:15:43,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:43,042 INFO L475 AbstractCegarLoop]: Abstraction has 5600 states and 8993 transitions. [2019-10-02 12:15:43,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 12:15:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 8993 transitions. [2019-10-02 12:15:43,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:15:43,047 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:43,047 INFO L411 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] [2019-10-02 12:15:43,047 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:43,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2071050646, now seen corresponding path program 1 times [2019-10-02 12:15:43,048 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:43,048 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:43,050 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:43,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:43,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:43,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:43,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-02 12:15:43,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 12:15:43,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 12:15:43,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-02 12:15:43,230 INFO L87 Difference]: Start difference. First operand 5600 states and 8993 transitions. Second operand 9 states. [2019-10-02 12:15:50,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:50,702 INFO L93 Difference]: Finished difference Result 14795 states and 24355 transitions. [2019-10-02 12:15:50,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:15:50,703 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 139 [2019-10-02 12:15:50,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:50,763 INFO L225 Difference]: With dead ends: 14795 [2019-10-02 12:15:50,764 INFO L226 Difference]: Without dead ends: 9255 [2019-10-02 12:15:50,794 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-02 12:15:50,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9255 states. [2019-10-02 12:15:51,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9255 to 8645. [2019-10-02 12:15:51,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8645 states. [2019-10-02 12:15:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8645 states to 8645 states and 13813 transitions. [2019-10-02 12:15:51,343 INFO L78 Accepts]: Start accepts. Automaton has 8645 states and 13813 transitions. Word has length 139 [2019-10-02 12:15:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:15:51,343 INFO L475 AbstractCegarLoop]: Abstraction has 8645 states and 13813 transitions. [2019-10-02 12:15:51,343 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 12:15:51,344 INFO L276 IsEmpty]: Start isEmpty. Operand 8645 states and 13813 transitions. [2019-10-02 12:15:51,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 12:15:51,348 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:15:51,348 INFO L411 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] [2019-10-02 12:15:51,348 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:15:51,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:15:51,348 INFO L82 PathProgramCache]: Analyzing trace with hash -937860053, now seen corresponding path program 1 times [2019-10-02 12:15:51,349 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:15:51,349 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:15:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:51,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:15:51,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:15:51,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:15:51,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:15:51,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:15:51,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:15:51,497 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:15:51,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:15:51,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:15:51,498 INFO L87 Difference]: Start difference. First operand 8645 states and 13813 transitions. Second operand 7 states. [2019-10-02 12:15:56,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:15:56,808 INFO L93 Difference]: Finished difference Result 24968 states and 41171 transitions. [2019-10-02 12:15:56,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 12:15:56,809 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 139 [2019-10-02 12:15:56,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:15:56,990 INFO L225 Difference]: With dead ends: 24968 [2019-10-02 12:15:56,990 INFO L226 Difference]: Without dead ends: 17579 [2019-10-02 12:15:57,040 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 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-10-02 12:15:57,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17579 states. [2019-10-02 12:16:00,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17579 to 17197. [2019-10-02 12:16:00,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17197 states. [2019-10-02 12:16:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17197 states to 17197 states and 27862 transitions. [2019-10-02 12:16:00,153 INFO L78 Accepts]: Start accepts. Automaton has 17197 states and 27862 transitions. Word has length 139 [2019-10-02 12:16:00,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:00,158 INFO L475 AbstractCegarLoop]: Abstraction has 17197 states and 27862 transitions. [2019-10-02 12:16:00,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:16:00,158 INFO L276 IsEmpty]: Start isEmpty. Operand 17197 states and 27862 transitions. [2019-10-02 12:16:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-02 12:16:00,166 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:00,167 INFO L411 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, 1, 1] [2019-10-02 12:16:00,167 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:00,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1123011920, now seen corresponding path program 1 times [2019-10-02 12:16:00,168 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:00,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:00,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:00,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:00,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:00,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:16:00,388 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:00,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 12:16:00,389 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 12:16:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 12:16:00,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:16:00,390 INFO L87 Difference]: Start difference. First operand 17197 states and 27862 transitions. Second operand 5 states. [2019-10-02 12:16:01,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:01,199 INFO L93 Difference]: Finished difference Result 33378 states and 54663 transitions. [2019-10-02 12:16:01,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:16:01,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-10-02 12:16:01,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:01,328 INFO L225 Difference]: With dead ends: 33378 [2019-10-02 12:16:01,328 INFO L226 Difference]: Without dead ends: 17602 [2019-10-02 12:16:01,397 INFO L640 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-10-02 12:16:01,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17602 states. [2019-10-02 12:16:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17602 to 17386. [2019-10-02 12:16:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17386 states. [2019-10-02 12:16:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17386 states to 17386 states and 28126 transitions. [2019-10-02 12:16:02,604 INFO L78 Accepts]: Start accepts. Automaton has 17386 states and 28126 transitions. Word has length 144 [2019-10-02 12:16:02,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:02,605 INFO L475 AbstractCegarLoop]: Abstraction has 17386 states and 28126 transitions. [2019-10-02 12:16:02,605 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 12:16:02,605 INFO L276 IsEmpty]: Start isEmpty. Operand 17386 states and 28126 transitions. [2019-10-02 12:16:02,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-02 12:16:02,611 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:02,611 INFO L411 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:02,612 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:02,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:02,612 INFO L82 PathProgramCache]: Analyzing trace with hash -67888017, now seen corresponding path program 1 times [2019-10-02 12:16:02,612 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:02,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:02,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:02,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:02,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 12:16:02,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:02,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:16:02,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:16:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:16:02,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:16:02,761 INFO L87 Difference]: Start difference. First operand 17386 states and 28126 transitions. Second operand 7 states. [2019-10-02 12:16:04,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:04,345 INFO L93 Difference]: Finished difference Result 35544 states and 59061 transitions. [2019-10-02 12:16:04,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 12:16:04,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 151 [2019-10-02 12:16:04,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:04,460 INFO L225 Difference]: With dead ends: 35544 [2019-10-02 12:16:04,461 INFO L226 Difference]: Without dead ends: 17386 [2019-10-02 12:16:04,534 INFO L640 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-10-02 12:16:04,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17386 states. [2019-10-02 12:16:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17386 to 17386. [2019-10-02 12:16:05,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17386 states. [2019-10-02 12:16:05,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17386 states to 17386 states and 27736 transitions. [2019-10-02 12:16:05,248 INFO L78 Accepts]: Start accepts. Automaton has 17386 states and 27736 transitions. Word has length 151 [2019-10-02 12:16:05,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:05,248 INFO L475 AbstractCegarLoop]: Abstraction has 17386 states and 27736 transitions. [2019-10-02 12:16:05,248 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:16:05,248 INFO L276 IsEmpty]: Start isEmpty. Operand 17386 states and 27736 transitions. [2019-10-02 12:16:05,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-02 12:16:05,254 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:05,254 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:05,254 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:05,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:05,255 INFO L82 PathProgramCache]: Analyzing trace with hash 455720139, now seen corresponding path program 1 times [2019-10-02 12:16:05,255 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:05,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:05,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:05,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:05,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:05,396 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 12:16:05,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:05,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 12:16:05,397 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 12:16:05,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 12:16:05,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 12:16:05,398 INFO L87 Difference]: Start difference. First operand 17386 states and 27736 transitions. Second operand 7 states. [2019-10-02 12:16:10,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:10,232 INFO L93 Difference]: Finished difference Result 34932 states and 56289 transitions. [2019-10-02 12:16:10,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-02 12:16:10,233 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 156 [2019-10-02 12:16:10,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:10,335 INFO L225 Difference]: With dead ends: 34932 [2019-10-02 12:16:10,336 INFO L226 Difference]: Without dead ends: 18989 [2019-10-02 12:16:10,395 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-10-02 12:16:10,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18989 states. [2019-10-02 12:16:11,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18989 to 18448. [2019-10-02 12:16:11,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18448 states. [2019-10-02 12:16:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18448 states to 18448 states and 29176 transitions. [2019-10-02 12:16:11,350 INFO L78 Accepts]: Start accepts. Automaton has 18448 states and 29176 transitions. Word has length 156 [2019-10-02 12:16:11,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:11,351 INFO L475 AbstractCegarLoop]: Abstraction has 18448 states and 29176 transitions. [2019-10-02 12:16:11,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 12:16:11,351 INFO L276 IsEmpty]: Start isEmpty. Operand 18448 states and 29176 transitions. [2019-10-02 12:16:11,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-02 12:16:11,356 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:11,356 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:11,357 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:11,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:11,357 INFO L82 PathProgramCache]: Analyzing trace with hash -656363757, now seen corresponding path program 1 times [2019-10-02 12:16:11,357 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:11,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:11,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:11,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:11,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:16:11,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:11,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-02 12:16:11,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-02 12:16:11,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-02 12:16:11,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-02 12:16:11,536 INFO L87 Difference]: Start difference. First operand 18448 states and 29176 transitions. Second operand 11 states. [2019-10-02 12:16:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:19,094 INFO L93 Difference]: Finished difference Result 41680 states and 66557 transitions. [2019-10-02 12:16:19,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-02 12:16:19,094 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 163 [2019-10-02 12:16:19,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:19,213 INFO L225 Difference]: With dead ends: 41680 [2019-10-02 12:16:19,213 INFO L226 Difference]: Without dead ends: 24458 [2019-10-02 12:16:19,275 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-10-02 12:16:19,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24458 states. [2019-10-02 12:16:20,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24458 to 23736. [2019-10-02 12:16:20,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23736 states. [2019-10-02 12:16:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23736 states to 23736 states and 36886 transitions. [2019-10-02 12:16:20,392 INFO L78 Accepts]: Start accepts. Automaton has 23736 states and 36886 transitions. Word has length 163 [2019-10-02 12:16:20,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:20,392 INFO L475 AbstractCegarLoop]: Abstraction has 23736 states and 36886 transitions. [2019-10-02 12:16:20,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-02 12:16:20,392 INFO L276 IsEmpty]: Start isEmpty. Operand 23736 states and 36886 transitions. [2019-10-02 12:16:20,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:16:20,399 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:20,399 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:20,400 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:20,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:20,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1238020489, now seen corresponding path program 1 times [2019-10-02 12:16:20,400 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:20,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:20,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:20,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:20,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:20,537 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:16:20,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:20,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 12:16:20,538 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 12:16:20,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 12:16:20,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 12:16:20,539 INFO L87 Difference]: Start difference. First operand 23736 states and 36886 transitions. Second operand 6 states. [2019-10-02 12:16:21,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:21,860 INFO L93 Difference]: Finished difference Result 57278 states and 90450 transitions. [2019-10-02 12:16:21,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 12:16:21,861 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2019-10-02 12:16:21,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:21,993 INFO L225 Difference]: With dead ends: 57278 [2019-10-02 12:16:21,993 INFO L226 Difference]: Without dead ends: 34985 [2019-10-02 12:16:22,046 INFO L640 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-10-02 12:16:22,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34985 states. [2019-10-02 12:16:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34985 to 29511. [2019-10-02 12:16:23,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29511 states. [2019-10-02 12:16:23,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29511 states to 29511 states and 46465 transitions. [2019-10-02 12:16:23,804 INFO L78 Accepts]: Start accepts. Automaton has 29511 states and 46465 transitions. Word has length 161 [2019-10-02 12:16:23,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:23,804 INFO L475 AbstractCegarLoop]: Abstraction has 29511 states and 46465 transitions. [2019-10-02 12:16:23,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 12:16:23,805 INFO L276 IsEmpty]: Start isEmpty. Operand 29511 states and 46465 transitions. [2019-10-02 12:16:23,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-02 12:16:23,810 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:23,810 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:23,810 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1165633931, now seen corresponding path program 1 times [2019-10-02 12:16:23,811 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:23,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:23,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:23,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:23,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:23,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:24,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:16:24,009 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:24,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:24,010 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:24,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:24,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:24,011 INFO L87 Difference]: Start difference. First operand 29511 states and 46465 transitions. Second operand 4 states. [2019-10-02 12:16:28,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:28,994 INFO L93 Difference]: Finished difference Result 81670 states and 134010 transitions. [2019-10-02 12:16:28,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:16:28,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-10-02 12:16:28,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:29,248 INFO L225 Difference]: With dead ends: 81670 [2019-10-02 12:16:29,248 INFO L226 Difference]: Without dead ends: 52225 [2019-10-02 12:16:29,324 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:16:29,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52225 states. [2019-10-02 12:16:31,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52225 to 51657. [2019-10-02 12:16:31,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51657 states. [2019-10-02 12:16:31,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51657 states to 51657 states and 83666 transitions. [2019-10-02 12:16:31,301 INFO L78 Accepts]: Start accepts. Automaton has 51657 states and 83666 transitions. Word has length 161 [2019-10-02 12:16:31,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:31,302 INFO L475 AbstractCegarLoop]: Abstraction has 51657 states and 83666 transitions. [2019-10-02 12:16:31,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 51657 states and 83666 transitions. [2019-10-02 12:16:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-02 12:16:31,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:31,306 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:31,306 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash -424333131, now seen corresponding path program 1 times [2019-10-02 12:16:31,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:31,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:31,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:16:31,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:31,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:31,448 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:31,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:31,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:31,449 INFO L87 Difference]: Start difference. First operand 51657 states and 83666 transitions. Second operand 4 states. [2019-10-02 12:16:37,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:37,155 INFO L93 Difference]: Finished difference Result 151671 states and 266366 transitions. [2019-10-02 12:16:37,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:16:37,155 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 164 [2019-10-02 12:16:37,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:37,672 INFO L225 Difference]: With dead ends: 151671 [2019-10-02 12:16:37,672 INFO L226 Difference]: Without dead ends: 100080 [2019-10-02 12:16:37,814 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:16:37,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100080 states. [2019-10-02 12:16:45,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100080 to 98831. [2019-10-02 12:16:45,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98831 states. [2019-10-02 12:16:45,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98831 states to 98831 states and 170036 transitions. [2019-10-02 12:16:45,743 INFO L78 Accepts]: Start accepts. Automaton has 98831 states and 170036 transitions. Word has length 164 [2019-10-02 12:16:45,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:16:45,744 INFO L475 AbstractCegarLoop]: Abstraction has 98831 states and 170036 transitions. [2019-10-02 12:16:45,744 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:16:45,744 INFO L276 IsEmpty]: Start isEmpty. Operand 98831 states and 170036 transitions. [2019-10-02 12:16:45,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-10-02 12:16:45,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:16:45,748 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:16:45,748 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:16:45,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:16:45,749 INFO L82 PathProgramCache]: Analyzing trace with hash -270723818, now seen corresponding path program 1 times [2019-10-02 12:16:45,749 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:16:45,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:16:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:45,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:16:45,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:16:45,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:16:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:16:45,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:16:45,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:16:45,888 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:16:45,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:16:45,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:16:45,889 INFO L87 Difference]: Start difference. First operand 98831 states and 170036 transitions. Second operand 4 states. [2019-10-02 12:16:58,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:16:58,225 INFO L93 Difference]: Finished difference Result 302746 states and 603214 transitions. [2019-10-02 12:16:58,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:16:58,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-10-02 12:16:58,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:16:59,618 INFO L225 Difference]: With dead ends: 302746 [2019-10-02 12:16:59,618 INFO L226 Difference]: Without dead ends: 203981 [2019-10-02 12:16:59,956 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:17:00,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203981 states. [2019-10-02 12:17:16,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203981 to 201067. [2019-10-02 12:17:16,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201067 states. [2019-10-02 12:17:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201067 states to 201067 states and 386373 transitions. [2019-10-02 12:17:18,994 INFO L78 Accepts]: Start accepts. Automaton has 201067 states and 386373 transitions. Word has length 165 [2019-10-02 12:17:18,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:17:18,994 INFO L475 AbstractCegarLoop]: Abstraction has 201067 states and 386373 transitions. [2019-10-02 12:17:18,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:17:18,995 INFO L276 IsEmpty]: Start isEmpty. Operand 201067 states and 386373 transitions. [2019-10-02 12:17:19,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-02 12:17:19,000 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:17:19,000 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:17:19,000 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:17:19,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:17:19,001 INFO L82 PathProgramCache]: Analyzing trace with hash 196201495, now seen corresponding path program 1 times [2019-10-02 12:17:19,001 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:17:19,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:17:19,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:19,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:17:19,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:17:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:17:19,143 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:17:19,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:17:19,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:17:19,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:17:19,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:17:19,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:17:19,146 INFO L87 Difference]: Start difference. First operand 201067 states and 386373 transitions. Second operand 4 states. [2019-10-02 12:17:58,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 12:17:58,334 INFO L93 Difference]: Finished difference Result 635695 states and 1564047 transitions. [2019-10-02 12:17:58,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 12:17:58,335 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 166 [2019-10-02 12:17:58,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 12:18:10,468 INFO L225 Difference]: With dead ends: 635695 [2019-10-02 12:18:10,469 INFO L226 Difference]: Without dead ends: 434694 [2019-10-02 12:18:11,336 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 12:18:11,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434694 states. [2019-10-02 12:18:49,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434694 to 427539. [2019-10-02 12:18:49,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427539 states. [2019-10-02 12:19:08,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427539 states to 427539 states and 988234 transitions. [2019-10-02 12:19:08,362 INFO L78 Accepts]: Start accepts. Automaton has 427539 states and 988234 transitions. Word has length 166 [2019-10-02 12:19:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 12:19:08,363 INFO L475 AbstractCegarLoop]: Abstraction has 427539 states and 988234 transitions. [2019-10-02 12:19:08,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 12:19:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 427539 states and 988234 transitions. [2019-10-02 12:19:08,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-02 12:19:08,372 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 12:19:08,373 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 12:19:08,373 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 12:19:08,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 12:19:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1785988216, now seen corresponding path program 1 times [2019-10-02 12:19:08,374 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 12:19:08,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 12:19:08,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:19:08,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 12:19:08,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 12:19:08,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 12:19:08,509 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-02 12:19:08,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 12:19:08,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 12:19:08,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 12:19:08,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 12:19:08,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 12:19:08,511 INFO L87 Difference]: Start difference. First operand 427539 states and 988234 transitions. Second operand 4 states.