/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:40:34,873 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:40:34,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:40:34,919 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:40:34,920 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:40:34,921 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:40:34,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:40:34,926 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:40:34,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:40:34,930 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:40:34,931 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:40:34,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:40:34,934 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:40:34,935 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:40:34,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:40:34,938 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:40:34,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:40:34,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:40:34,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:40:34,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:40:34,952 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:40:34,955 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:40:34,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:40:34,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:40:34,993 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:40:34,995 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:40:34,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:40:34,998 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:40:35,003 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:40:35,005 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:40:35,006 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:40:35,007 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:40:35,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:40:35,011 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:40:35,012 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:40:35,012 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:40:35,013 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:40:35,014 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:40:35,014 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:40:35,015 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:40:35,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:40:35,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-11-07 06:40:35,047 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:40:35,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:40:35,054 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:40:35,054 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:40:35,054 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:40:35,054 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:40:35,055 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:40:35,055 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:40:35,055 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:40:35,055 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:40:35,057 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:40:35,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:40:35,057 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:40:35,057 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:40:35,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:40:35,058 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:40:35,058 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:40:35,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:40:35,058 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:40:35,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:40:35,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:40:35,059 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:40:35,059 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-11-07 06:40:35,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:40:35,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:40:35,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:40:35,516 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:40:35,517 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:40:35,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2020-11-07 06:40:35,615 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a299e10/973964daa6164fc08c3249f061d4e55a/FLAG5d55cc2e4 [2020-11-07 06:40:36,365 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:40:36,366 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i [2020-11-07 06:40:36,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a299e10/973964daa6164fc08c3249f061d4e55a/FLAG5d55cc2e4 [2020-11-07 06:40:36,733 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f2a299e10/973964daa6164fc08c3249f061d4e55a [2020-11-07 06:40:36,739 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:40:36,747 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:40:36,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:40:36,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:40:36,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:40:36,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:36" (1/1) ... [2020-11-07 06:40:36,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7653d3e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:36, skipping insertion in model container [2020-11-07 06:40:36,766 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:40:36" (1/1) ... [2020-11-07 06:40:36,776 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:40:36,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:40:36,983 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:40:36,994 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:40:37,010 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:40:37,029 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:40:37,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37 WrapperNode [2020-11-07 06:40:37,030 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:40:37,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:40:37,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:40:37,032 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:40:37,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (1/1) ... [2020-11-07 06:40:37,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (1/1) ... [2020-11-07 06:40:37,056 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (1/1) ... [2020-11-07 06:40:37,057 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (1/1) ... [2020-11-07 06:40:37,064 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (1/1) ... [2020-11-07 06:40:37,069 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (1/1) ... [2020-11-07 06:40:37,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (1/1) ... [2020-11-07 06:40:37,074 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:40:37,075 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:40:37,075 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:40:37,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:40:37,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (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 [2020-11-07 06:40:37,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:40:37,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:40:37,180 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:40:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:40:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:40:37,181 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:40:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:40:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:40:37,182 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:40:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:40:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:40:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:40:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:40:37,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:40:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:40:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:40:37,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:40:37,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:40:37,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:40:37,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:40:37,186 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:40:37,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:40:37,699 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:40:37,700 INFO L298 CfgBuilder]: Removed 1 assume(true) statements. [2020-11-07 06:40:37,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:37 BoogieIcfgContainer [2020-11-07 06:40:37,702 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:40:37,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:40:37,704 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:40:37,708 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:40:37,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:40:36" (1/3) ... [2020-11-07 06:40:37,710 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658dfaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:37, skipping insertion in model container [2020-11-07 06:40:37,710 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:40:37" (2/3) ... [2020-11-07 06:40:37,711 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@658dfaaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:40:37, skipping insertion in model container [2020-11-07 06:40:37,711 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:40:37" (3/3) ... [2020-11-07 06:40:37,712 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.i [2020-11-07 06:40:37,730 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:40:37,734 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:40:37,748 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:40:37,778 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:40:37,779 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:40:37,779 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:40:37,779 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:40:37,779 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:40:37,780 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:40:37,780 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:40:37,780 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:40:37,799 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2020-11-07 06:40:37,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 06:40:37,812 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:37,813 INFO L422 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] [2020-11-07 06:40:37,814 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:37,821 INFO L82 PathProgramCache]: Analyzing trace with hash -451165637, now seen corresponding path program 1 times [2020-11-07 06:40:37,833 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:37,834 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1182922919] [2020-11-07 06:40:37,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:38,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:38,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:38,214 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1182922919] [2020-11-07 06:40:38,217 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:40:38,217 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:40:38,218 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424216172] [2020-11-07 06:40:38,226 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:40:38,227 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:38,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:40:38,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:40:38,250 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 4 states. [2020-11-07 06:40:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:38,460 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2020-11-07 06:40:38,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 06:40:38,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-07 06:40:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:38,472 INFO L225 Difference]: With dead ends: 60 [2020-11-07 06:40:38,472 INFO L226 Difference]: Without dead ends: 32 [2020-11-07 06:40:38,477 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-07 06:40:38,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-07 06:40:38,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2020-11-07 06:40:38,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-07 06:40:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2020-11-07 06:40:38,541 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2020-11-07 06:40:38,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:38,541 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2020-11-07 06:40:38,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:40:38,542 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2020-11-07 06:40:38,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-11-07 06:40:38,543 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:38,543 INFO L422 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] [2020-11-07 06:40:38,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:40:38,544 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:38,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:38,545 INFO L82 PathProgramCache]: Analyzing trace with hash 13853325, now seen corresponding path program 1 times [2020-11-07 06:40:38,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:38,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1642998636] [2020-11-07 06:40:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:38,898 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:38,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:38,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:38,939 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1642998636] [2020-11-07 06:40:38,939 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:38,940 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:40:38,940 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28449574] [2020-11-07 06:40:38,942 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:40:38,942 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:38,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:40:38,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:40:38,945 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 10 states. [2020-11-07 06:40:39,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:39,484 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-11-07 06:40:39,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 06:40:39,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2020-11-07 06:40:39,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:39,486 INFO L225 Difference]: With dead ends: 44 [2020-11-07 06:40:39,487 INFO L226 Difference]: Without dead ends: 37 [2020-11-07 06:40:39,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2020-11-07 06:40:39,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-11-07 06:40:39,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-11-07 06:40:39,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-11-07 06:40:39,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-11-07 06:40:39,502 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2020-11-07 06:40:39,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:39,502 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-11-07 06:40:39,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:40:39,503 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-11-07 06:40:39,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-07 06:40:39,504 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:39,504 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:39,505 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:40:39,505 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:39,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:39,506 INFO L82 PathProgramCache]: Analyzing trace with hash 852305275, now seen corresponding path program 2 times [2020-11-07 06:40:39,506 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:39,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1443647610] [2020-11-07 06:40:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:39,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:39,719 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:39,736 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1443647610] [2020-11-07 06:40:39,736 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:39,736 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-11-07 06:40:39,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003410284] [2020-11-07 06:40:39,738 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-07 06:40:39,738 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:39,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-07 06:40:39,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-11-07 06:40:39,740 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2020-11-07 06:40:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:40,467 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2020-11-07 06:40:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 06:40:40,467 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2020-11-07 06:40:40,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:40,469 INFO L225 Difference]: With dead ends: 49 [2020-11-07 06:40:40,469 INFO L226 Difference]: Without dead ends: 42 [2020-11-07 06:40:40,471 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:40:40,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-11-07 06:40:40,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2020-11-07 06:40:40,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-11-07 06:40:40,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-11-07 06:40:40,484 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2020-11-07 06:40:40,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:40,485 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-11-07 06:40:40,485 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-11-07 06:40:40,485 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-11-07 06:40:40,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-07 06:40:40,486 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:40,486 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:40,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:40:40,487 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:40,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:40,488 INFO L82 PathProgramCache]: Analyzing trace with hash -155318451, now seen corresponding path program 3 times [2020-11-07 06:40:40,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:40,489 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [507131777] [2020-11-07 06:40:40,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:40,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:40,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:40,869 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:40,869 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [507131777] [2020-11-07 06:40:40,870 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:40,870 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-11-07 06:40:40,870 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242947112] [2020-11-07 06:40:40,871 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-11-07 06:40:40,871 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:40,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-11-07 06:40:40,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2020-11-07 06:40:40,873 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 16 states. [2020-11-07 06:40:41,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:41,779 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2020-11-07 06:40:41,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-11-07 06:40:41,781 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 40 [2020-11-07 06:40:41,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:41,785 INFO L225 Difference]: With dead ends: 54 [2020-11-07 06:40:41,785 INFO L226 Difference]: Without dead ends: 47 [2020-11-07 06:40:41,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=129, Invalid=863, Unknown=0, NotChecked=0, Total=992 [2020-11-07 06:40:41,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-11-07 06:40:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2020-11-07 06:40:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-11-07 06:40:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2020-11-07 06:40:41,808 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2020-11-07 06:40:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:41,809 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2020-11-07 06:40:41,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-11-07 06:40:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2020-11-07 06:40:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-07 06:40:41,813 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:41,814 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:41,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:40:41,814 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:41,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:41,815 INFO L82 PathProgramCache]: Analyzing trace with hash -2121566021, now seen corresponding path program 4 times [2020-11-07 06:40:41,815 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:41,816 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [41202765] [2020-11-07 06:40:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:41,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:42,182 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:42,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:42,210 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:42,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [41202765] [2020-11-07 06:40:42,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:42,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 06:40:42,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470471416] [2020-11-07 06:40:42,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 06:40:42,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:42,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 06:40:42,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:40:42,214 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 19 states. [2020-11-07 06:40:43,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:43,486 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2020-11-07 06:40:43,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-11-07 06:40:43,486 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2020-11-07 06:40:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:43,488 INFO L225 Difference]: With dead ends: 59 [2020-11-07 06:40:43,488 INFO L226 Difference]: Without dead ends: 52 [2020-11-07 06:40:43,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=161, Invalid=1321, Unknown=0, NotChecked=0, Total=1482 [2020-11-07 06:40:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-11-07 06:40:43,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-11-07 06:40:43,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 06:40:43,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2020-11-07 06:40:43,515 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2020-11-07 06:40:43,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:43,516 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2020-11-07 06:40:43,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 06:40:43,516 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2020-11-07 06:40:43,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-07 06:40:43,517 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:43,518 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:43,518 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:40:43,518 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:43,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:43,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1043446797, now seen corresponding path program 5 times [2020-11-07 06:40:43,519 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:43,520 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [581000435] [2020-11-07 06:40:43,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:43,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:44,001 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:44,031 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:44,031 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [581000435] [2020-11-07 06:40:44,032 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:44,032 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-11-07 06:40:44,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016658677] [2020-11-07 06:40:44,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-11-07 06:40:44,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:44,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-11-07 06:40:44,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=416, Unknown=0, NotChecked=0, Total=462 [2020-11-07 06:40:44,040 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 22 states. [2020-11-07 06:40:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:45,566 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2020-11-07 06:40:45,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-11-07 06:40:45,567 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 50 [2020-11-07 06:40:45,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:45,569 INFO L225 Difference]: With dead ends: 64 [2020-11-07 06:40:45,570 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 06:40:45,572 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=1877, Unknown=0, NotChecked=0, Total=2070 [2020-11-07 06:40:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 06:40:45,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2020-11-07 06:40:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 06:40:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2020-11-07 06:40:45,588 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2020-11-07 06:40:45,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:45,588 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2020-11-07 06:40:45,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-11-07 06:40:45,589 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2020-11-07 06:40:45,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2020-11-07 06:40:45,590 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:45,590 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:45,590 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:40:45,591 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:45,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:45,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555771, now seen corresponding path program 6 times [2020-11-07 06:40:45,592 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:45,592 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1638271189] [2020-11-07 06:40:45,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:46,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:46,162 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:46,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1638271189] [2020-11-07 06:40:46,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:46,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-11-07 06:40:46,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185118523] [2020-11-07 06:40:46,164 INFO L461 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-11-07 06:40:46,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:46,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-11-07 06:40:46,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=547, Unknown=0, NotChecked=0, Total=600 [2020-11-07 06:40:46,165 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 25 states. [2020-11-07 06:40:48,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:48,081 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2020-11-07 06:40:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2020-11-07 06:40:48,083 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 55 [2020-11-07 06:40:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:48,085 INFO L225 Difference]: With dead ends: 69 [2020-11-07 06:40:48,085 INFO L226 Difference]: Without dead ends: 62 [2020-11-07 06:40:48,087 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=234, Invalid=2628, Unknown=0, NotChecked=0, Total=2862 [2020-11-07 06:40:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2020-11-07 06:40:48,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2020-11-07 06:40:48,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-07 06:40:48,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2020-11-07 06:40:48,104 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2020-11-07 06:40:48,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:48,104 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2020-11-07 06:40:48,105 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-11-07 06:40:48,105 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2020-11-07 06:40:48,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-07 06:40:48,106 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:48,106 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:48,106 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:40:48,106 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:48,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:48,107 INFO L82 PathProgramCache]: Analyzing trace with hash -1961197363, now seen corresponding path program 7 times [2020-11-07 06:40:48,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:48,108 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [853901854] [2020-11-07 06:40:48,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:48,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:48,760 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:48,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [853901854] [2020-11-07 06:40:48,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:48,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2020-11-07 06:40:48,761 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027421938] [2020-11-07 06:40:48,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 28 states [2020-11-07 06:40:48,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:48,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2020-11-07 06:40:48,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=696, Unknown=0, NotChecked=0, Total=756 [2020-11-07 06:40:48,764 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2020-11-07 06:40:51,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:51,092 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2020-11-07 06:40:51,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2020-11-07 06:40:51,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2020-11-07 06:40:51,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:51,094 INFO L225 Difference]: With dead ends: 74 [2020-11-07 06:40:51,095 INFO L226 Difference]: Without dead ends: 67 [2020-11-07 06:40:51,100 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=275, Invalid=3507, Unknown=0, NotChecked=0, Total=3782 [2020-11-07 06:40:51,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2020-11-07 06:40:51,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2020-11-07 06:40:51,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-07 06:40:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2020-11-07 06:40:51,134 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2020-11-07 06:40:51,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:51,136 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2020-11-07 06:40:51,136 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2020-11-07 06:40:51,137 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2020-11-07 06:40:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-07 06:40:51,140 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:51,141 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:51,141 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:40:51,141 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:51,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:51,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1686180037, now seen corresponding path program 8 times [2020-11-07 06:40:51,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:51,150 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [213665322] [2020-11-07 06:40:51,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:51,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:51,876 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:51,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [213665322] [2020-11-07 06:40:51,893 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:51,894 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2020-11-07 06:40:51,894 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920046408] [2020-11-07 06:40:51,895 INFO L461 AbstractCegarLoop]: Interpolant automaton has 31 states [2020-11-07 06:40:51,895 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:51,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2020-11-07 06:40:51,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=863, Unknown=0, NotChecked=0, Total=930 [2020-11-07 06:40:51,896 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 31 states. [2020-11-07 06:40:54,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:54,709 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2020-11-07 06:40:54,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2020-11-07 06:40:54,710 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 65 [2020-11-07 06:40:54,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:54,712 INFO L225 Difference]: With dead ends: 79 [2020-11-07 06:40:54,712 INFO L226 Difference]: Without dead ends: 72 [2020-11-07 06:40:54,719 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1084 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=318, Invalid=4512, Unknown=0, NotChecked=0, Total=4830 [2020-11-07 06:40:54,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2020-11-07 06:40:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2020-11-07 06:40:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2020-11-07 06:40:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2020-11-07 06:40:54,752 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2020-11-07 06:40:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:54,752 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2020-11-07 06:40:54,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2020-11-07 06:40:54,753 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2020-11-07 06:40:54,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 06:40:54,761 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:54,762 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:54,762 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:40:54,762 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:54,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1704700531, now seen corresponding path program 9 times [2020-11-07 06:40:54,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:54,764 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [941203445] [2020-11-07 06:40:54,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:55,710 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:40:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:40:55,728 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:40:55,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [941203445] [2020-11-07 06:40:55,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:40:55,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2020-11-07 06:40:55,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094092645] [2020-11-07 06:40:55,729 INFO L461 AbstractCegarLoop]: Interpolant automaton has 34 states [2020-11-07 06:40:55,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:40:55,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2020-11-07 06:40:55,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=1048, Unknown=0, NotChecked=0, Total=1122 [2020-11-07 06:40:55,731 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 34 states. [2020-11-07 06:40:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:40:59,053 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2020-11-07 06:40:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2020-11-07 06:40:59,054 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 70 [2020-11-07 06:40:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:40:59,055 INFO L225 Difference]: With dead ends: 84 [2020-11-07 06:40:59,055 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 06:40:59,058 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1384 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=363, Invalid=5643, Unknown=0, NotChecked=0, Total=6006 [2020-11-07 06:40:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 06:40:59,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2020-11-07 06:40:59,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-07 06:40:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2020-11-07 06:40:59,089 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2020-11-07 06:40:59,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:40:59,089 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2020-11-07 06:40:59,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2020-11-07 06:40:59,090 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2020-11-07 06:40:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2020-11-07 06:40:59,095 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:40:59,095 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:40:59,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:40:59,096 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:40:59,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:40:59,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1126428037, now seen corresponding path program 10 times [2020-11-07 06:40:59,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:40:59,099 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [496343393] [2020-11-07 06:40:59,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:40:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:41:00,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:41:00,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:41:00,186 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:41:00,187 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [496343393] [2020-11-07 06:41:00,187 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:41:00,187 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2020-11-07 06:41:00,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163453510] [2020-11-07 06:41:00,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 37 states [2020-11-07 06:41:00,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:41:00,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2020-11-07 06:41:00,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1251, Unknown=0, NotChecked=0, Total=1332 [2020-11-07 06:41:00,190 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 37 states. [2020-11-07 06:41:03,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:41:03,948 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2020-11-07 06:41:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2020-11-07 06:41:03,948 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 75 [2020-11-07 06:41:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:41:03,949 INFO L225 Difference]: With dead ends: 77 [2020-11-07 06:41:03,950 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:41:03,953 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=413, Invalid=6897, Unknown=0, NotChecked=0, Total=7310 [2020-11-07 06:41:03,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:41:03,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:41:03,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:41:03,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:41:03,954 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2020-11-07 06:41:03,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:41:03,954 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:41:03,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2020-11-07 06:41:03,954 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:41:03,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:41:03,955 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 06:41:03,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:41:04,463 WARN L194 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 100 [2020-11-07 06:41:04,765 WARN L194 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 37 [2020-11-07 06:41:05,011 WARN L194 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2020-11-07 06:41:05,220 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 49 [2020-11-07 06:41:05,358 WARN L194 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 31 [2020-11-07 06:41:05,623 WARN L194 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 40 [2020-11-07 06:41:05,633 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,633 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,633 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,633 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,633 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,634 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,634 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:41:05,634 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:41:05,634 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,634 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,636 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,636 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,636 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2020-11-07 06:41:05,637 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:41:05,637 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:41:05,637 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:41:05,637 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:41:05,637 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:41:05,637 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:41:05,638 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-07 06:41:05,638 INFO L266 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-11-07 06:41:05,638 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:41:05,638 INFO L266 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:41:05,638 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:41:05,639 INFO L269 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: true [2020-11-07 06:41:05,639 INFO L262 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (or (<= (+ main_~x~0 95) (* 10 main_~y~0)) (<= (+ main_~x~0 50) main_~y~0) (<= (+ main_~x~0 56) (* 4 main_~y~0)) (<= (+ main_~x~0 65) (* 6 main_~y~0)) (<= (+ main_~x~0 53) (* 3 main_~y~0)) (<= (+ main_~x~0 78) (* 8 main_~y~0))) [2020-11-07 06:41:05,640 INFO L262 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (or (let ((.cse0 (+ main_~x~0 53))) (and (<= .cse0 (* 3 |main_#t~post4|)) (<= .cse0 (* 3 main_~y~0)))) (let ((.cse1 (+ main_~x~0 95))) (and (<= .cse1 (* 10 main_~y~0)) (<= .cse1 (* 10 |main_#t~post4|)))) (let ((.cse2 (+ main_~x~0 71))) (and (<= .cse2 (* 7 main_~y~0)) (<= .cse2 (* 7 |main_#t~post4|)))) (let ((.cse3 (+ main_~x~0 50))) (and (<= .cse3 main_~y~0) (<= .cse3 |main_#t~post4|))) (let ((.cse4 (+ main_~x~0 60))) (and (<= .cse4 (* 5 |main_#t~post4|)) (<= .cse4 (* 5 main_~y~0)))) (let ((.cse5 (+ main_~x~0 86))) (and (<= .cse5 (* 9 main_~y~0)) (<= .cse5 (* 9 |main_#t~post4|))))) [2020-11-07 06:41:05,641 INFO L262 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse0 (+ main_~x~0 51))) (or (and (<= (+ main_~x~0 71) (* 6 main_~y~0)) (<= (+ main_~x~0 65) (* 6 |main_#t~post4|))) (and (<= (+ main_~x~0 105) (* 10 main_~y~0)) (<= (+ main_~x~0 95) (* 10 |main_#t~post4|))) (and (<= (+ main_~x~0 78) (* 8 |main_#t~post4|)) (<= (+ main_~x~0 86) (* 8 main_~y~0))) (and (<= .cse0 main_~y~0) (<= (+ main_~x~0 50) |main_#t~post4|)) (and (<= (+ main_~x~0 56) (* 4 |main_#t~post4|)) (<= (+ main_~x~0 60) (* 4 main_~y~0))) (and (<= (+ main_~x~0 53) (* 2 main_~y~0)) (<= .cse0 (* 2 |main_#t~post4|))))) [2020-11-07 06:41:05,641 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-11-07 06:41:05,641 INFO L262 CegarLoopResult]: At program point L29-2(lines 29 32) the Hoare annotation is: (or (<= (+ main_~x~0 53) (* 2 main_~y~0)) (<= (+ main_~x~0 65) (* 5 main_~y~0)) (<= (+ main_~x~0 50) 0) (<= (+ main_~x~0 56) (* 3 main_~y~0)) (<= (+ main_~x~0 105) (* 10 main_~y~0)) (<= (+ main_~x~0 95) (* 9 main_~y~0)) (<= (+ main_~x~0 78) (* 7 main_~y~0))) [2020-11-07 06:41:05,641 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-11-07 06:41:05,642 INFO L262 CegarLoopResult]: At program point L29-3(lines 29 32) the Hoare annotation is: (and (<= 11 main_~y~0) (<= (+ main_~x~0 105) (* 10 main_~y~0))) [2020-11-07 06:41:05,645 INFO L269 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-11-07 06:41:05,645 INFO L262 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-11-07 06:41:05,646 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 24 35) the Hoare annotation is: true [2020-11-07 06:41:05,647 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 24 35) the Hoare annotation is: true [2020-11-07 06:41:05,647 INFO L262 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (let ((.cse0 (+ main_~x~0 65)) (.cse2 (* 6 main_~y~0))) (let ((.cse1 (<= .cse0 .cse2))) (or (<= (+ main_~x~0 53) (* 2 main_~y~0)) (<= .cse0 (* 5 main_~y~0)) (<= (+ main_~x~0 50) 0) (<= (+ main_~x~0 56) (* 3 main_~y~0)) (and .cse1 (<= (+ main_~x~0 86) (* 8 main_~y~0))) (and (<= (+ main_~x~0 105) (* 10 main_~y~0)) .cse1) (<= (+ main_~x~0 71) .cse2)))) [2020-11-07 06:41:05,648 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 35) the Hoare annotation is: true [2020-11-07 06:41:05,648 INFO L262 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-11-07 06:41:05,653 INFO L262 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-11-07 06:41:05,653 INFO L269 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: true [2020-11-07 06:41:05,654 INFO L269 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: true [2020-11-07 06:41:05,654 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-07 06:41:05,654 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: true [2020-11-07 06:41:05,654 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:41:05,657 INFO L262 CegarLoopResult]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:41:05,657 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:41:05,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:41:05 BoogieIcfgContainer [2020-11-07 06:41:05,691 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:41:05,695 INFO L168 Benchmark]: Toolchain (without parser) took 28951.56 ms. Allocated memory was 152.0 MB in the beginning and 336.6 MB in the end (delta: 184.5 MB). Free memory was 128.8 MB in the beginning and 212.7 MB in the end (delta: -83.9 MB). Peak memory consumption was 196.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:41:05,695 INFO L168 Benchmark]: CDTParser took 0.35 ms. Allocated memory is still 152.0 MB. Free memory is still 127.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:41:05,704 INFO L168 Benchmark]: CACSL2BoogieTranslator took 276.78 ms. Allocated memory is still 152.0 MB. Free memory was 128.2 MB in the beginning and 119.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:41:05,704 INFO L168 Benchmark]: Boogie Preprocessor took 42.53 ms. Allocated memory is still 152.0 MB. Free memory was 119.0 MB in the beginning and 117.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:41:05,705 INFO L168 Benchmark]: RCFGBuilder took 626.90 ms. Allocated memory is still 152.0 MB. Free memory was 117.3 MB in the beginning and 134.4 MB in the end (delta: -17.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:41:05,711 INFO L168 Benchmark]: TraceAbstraction took 27987.67 ms. Allocated memory was 152.0 MB in the beginning and 336.6 MB in the end (delta: 184.5 MB). Free memory was 134.4 MB in the beginning and 212.7 MB in the end (delta: -78.3 MB). Peak memory consumption was 201.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:41:05,721 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.35 ms. Allocated memory is still 152.0 MB. Free memory is still 127.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 276.78 ms. Allocated memory is still 152.0 MB. Free memory was 128.2 MB in the beginning and 119.0 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 42.53 ms. Allocated memory is still 152.0 MB. Free memory was 119.0 MB in the beginning and 117.5 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 626.90 ms. Allocated memory is still 152.0 MB. Free memory was 117.3 MB in the beginning and 134.4 MB in the end (delta: -17.1 MB). Peak memory consumption was 17.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 27987.67 ms. Allocated memory was 152.0 MB in the beginning and 336.6 MB in the end (delta: 184.5 MB). Free memory was 134.4 MB in the beginning and 212.7 MB in the end (delta: -78.3 MB). Peak memory consumption was 201.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((x + 53 <= 2 * y || x + 65 <= 5 * y) || x + 50 <= 0) || x + 56 <= 3 * y) || x + 105 <= 10 * y) || x + 95 <= 9 * y) || x + 78 <= 7 * y - ProcedureContractResult [Line: 12]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 26.1s, OverallIterations: 11, TraceHistogramMax: 10, AutomataDifference: 19.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 317 SDtfs, 587 SDslu, 1978 SDs, 0 SdLazy, 7015 SolverSat, 297 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 526 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 493 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6538 ImplicationChecksByTransitivity, 17.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 42 LocationsWithAnnotation, 162 PreInvPairs, 246 NumberOfFragments, 429 HoareAnnotationTreeSize, 162 FomulaSimplifications, 173087 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 42 FomulaSimplificationsInter, 2303 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 550 NumberOfCodeBlocks, 550 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 539 ConstructedInterpolants, 0 QuantifiedInterpolants, 148225 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...