/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-invgen/large_const.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:39:16,842 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:39:16,849 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:39:16,895 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:39:16,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:39:16,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:39:16,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:39:16,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:39:16,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:39:16,907 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:39:16,908 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:39:16,910 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:39:16,911 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:39:16,912 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:39:16,914 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:39:16,915 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:39:16,917 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:39:16,918 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:39:16,920 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:39:16,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:39:16,925 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:39:16,927 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:39:16,929 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:39:16,930 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:39:16,947 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:39:16,947 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:39:16,948 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:39:16,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:39:16,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:39:16,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:39:16,956 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:39:16,960 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:39:16,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:39:16,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:39:16,965 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:39:16,966 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:39:16,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:39:16,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:39:16,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:39:16,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:39:16,971 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:39:16,972 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:39:16,999 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:39:17,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:39:17,005 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:39:17,006 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:39:17,006 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:39:17,006 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:39:17,006 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:39:17,007 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:39:17,007 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:39:17,007 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:39:17,008 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:39:17,008 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:39:17,009 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:39:17,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:39:17,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:39:17,009 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:39:17,010 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:39:17,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:39:17,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:39:17,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:39:17,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:39:17,011 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:39:17,011 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:39:17,442 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:39:17,475 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:39:17,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:39:17,481 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:39:17,481 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:39:17,482 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/large_const.i [2020-11-07 06:39:17,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac81057ae/a036de8fbe324634913ce35a5375a849/FLAG66a9365d3 [2020-11-07 06:39:18,169 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:39:18,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/large_const.i [2020-11-07 06:39:18,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac81057ae/a036de8fbe324634913ce35a5375a849/FLAG66a9365d3 [2020-11-07 06:39:18,555 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac81057ae/a036de8fbe324634913ce35a5375a849 [2020-11-07 06:39:18,559 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:39:18,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:39:18,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:39:18,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:39:18,581 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:39:18,582 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:18,590 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5a2305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18, skipping insertion in model container [2020-11-07 06:39:18,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:18,603 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:39:18,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:39:18,905 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:39:18,918 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:39:18,949 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:39:18,970 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:39:18,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18 WrapperNode [2020-11-07 06:39:18,971 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:39:18,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:39:18,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:39:18,973 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:39:18,991 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:18,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:19,002 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:19,002 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:19,021 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:19,029 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:19,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (1/1) ... [2020-11-07 06:39:19,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:39:19,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:39:19,046 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:39:19,046 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:39:19,049 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (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:39:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:39:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:39:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:39:19,140 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:39:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:39:19,141 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:39:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:39:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:39:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:39:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:39:19,141 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:39:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:39:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:39:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:39:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-11-07 06:39:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:39:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:39:19,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:39:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:39:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:39:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:39:19,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:39:19,589 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:39:19,589 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 06:39:19,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:39:19 BoogieIcfgContainer [2020-11-07 06:39:19,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:39:19,593 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:39:19,593 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:39:19,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:39:19,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:39:18" (1/3) ... [2020-11-07 06:39:19,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f946a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:39:19, skipping insertion in model container [2020-11-07 06:39:19,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:39:18" (2/3) ... [2020-11-07 06:39:19,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67f946a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:39:19, skipping insertion in model container [2020-11-07 06:39:19,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:39:19" (3/3) ... [2020-11-07 06:39:19,606 INFO L111 eAbstractionObserver]: Analyzing ICFG large_const.i [2020-11-07 06:39:19,624 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:39:19,627 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:39:19,641 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:39:19,674 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:39:19,674 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:39:19,675 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:39:19,675 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:39:19,675 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:39:19,675 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:39:19,675 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:39:19,676 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:39:19,698 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2020-11-07 06:39:19,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 06:39:19,710 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:19,711 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, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:19,712 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:19,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:19,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1439685491, now seen corresponding path program 1 times [2020-11-07 06:39:19,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:19,733 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1190141662] [2020-11-07 06:39:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:20,055 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:20,085 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:39:20,086 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1190141662] [2020-11-07 06:39:20,089 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:20,089 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-07 06:39:20,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865987725] [2020-11-07 06:39:20,097 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-07 06:39:20,097 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:20,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-07 06:39:20,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:39:20,118 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2020-11-07 06:39:20,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:20,235 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2020-11-07 06:39:20,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-07 06:39:20,237 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2020-11-07 06:39:20,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:20,248 INFO L225 Difference]: With dead ends: 90 [2020-11-07 06:39:20,248 INFO L226 Difference]: Without dead ends: 57 [2020-11-07 06:39:20,252 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-07 06:39:20,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-07 06:39:20,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2020-11-07 06:39:20,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 06:39:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2020-11-07 06:39:20,331 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 36 [2020-11-07 06:39:20,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:20,332 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2020-11-07 06:39:20,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-07 06:39:20,332 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2020-11-07 06:39:20,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 06:39:20,334 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:20,334 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, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:20,335 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:39:20,335 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:20,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:20,336 INFO L82 PathProgramCache]: Analyzing trace with hash -563113616, now seen corresponding path program 1 times [2020-11-07 06:39:20,336 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:20,337 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [245952277] [2020-11-07 06:39:20,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:20,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:20,527 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:20,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:20,571 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:39:20,572 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [245952277] [2020-11-07 06:39:20,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:39:20,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 06:39:20,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880716750] [2020-11-07 06:39:20,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 06:39:20,579 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:20,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 06:39:20,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-11-07 06:39:20,581 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 6 states. [2020-11-07 06:39:20,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:20,908 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2020-11-07 06:39:20,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-07 06:39:20,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2020-11-07 06:39:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:20,911 INFO L225 Difference]: With dead ends: 78 [2020-11-07 06:39:20,911 INFO L226 Difference]: Without dead ends: 60 [2020-11-07 06:39:20,913 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:39:20,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2020-11-07 06:39:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2020-11-07 06:39:20,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2020-11-07 06:39:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2020-11-07 06:39:20,932 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 36 [2020-11-07 06:39:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:20,932 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2020-11-07 06:39:20,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 06:39:20,933 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2020-11-07 06:39:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-07 06:39:20,934 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:20,935 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:20,935 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:39:20,935 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:20,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:20,936 INFO L82 PathProgramCache]: Analyzing trace with hash -115429657, now seen corresponding path program 1 times [2020-11-07 06:39:20,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:20,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1938054173] [2020-11-07 06:39:20,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:20,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:21,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:21,103 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:39:21,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1938054173] [2020-11-07 06:39:21,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:21,104 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:39:21,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49316490] [2020-11-07 06:39:21,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:21,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:21,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:21,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:21,107 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 8 states. [2020-11-07 06:39:21,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:21,693 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2020-11-07 06:39:21,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:39:21,694 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2020-11-07 06:39:21,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:21,697 INFO L225 Difference]: With dead ends: 99 [2020-11-07 06:39:21,697 INFO L226 Difference]: Without dead ends: 95 [2020-11-07 06:39:21,698 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:39:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2020-11-07 06:39:21,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 75. [2020-11-07 06:39:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2020-11-07 06:39:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2020-11-07 06:39:21,722 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 46 [2020-11-07 06:39:21,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:21,723 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2020-11-07 06:39:21,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:21,723 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2020-11-07 06:39:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-07 06:39:21,725 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:21,725 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:21,725 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:39:21,726 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:21,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1489312715, now seen corresponding path program 1 times [2020-11-07 06:39:21,727 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:21,727 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1563798942] [2020-11-07 06:39:21,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:21,866 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:21,880 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:39:21,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1563798942] [2020-11-07 06:39:21,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:21,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:39:21,882 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985101947] [2020-11-07 06:39:21,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:21,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:21,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:21,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:21,884 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 8 states. [2020-11-07 06:39:22,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:22,371 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2020-11-07 06:39:22,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:39:22,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-11-07 06:39:22,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:22,375 INFO L225 Difference]: With dead ends: 116 [2020-11-07 06:39:22,376 INFO L226 Difference]: Without dead ends: 112 [2020-11-07 06:39:22,377 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:39:22,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-07 06:39:22,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 94. [2020-11-07 06:39:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-11-07 06:39:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2020-11-07 06:39:22,402 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 47 [2020-11-07 06:39:22,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:22,402 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2020-11-07 06:39:22,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:22,403 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2020-11-07 06:39:22,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-07 06:39:22,404 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:22,405 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:22,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:39:22,405 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:22,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:22,406 INFO L82 PathProgramCache]: Analyzing trace with hash -196114581, now seen corresponding path program 1 times [2020-11-07 06:39:22,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:22,406 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [915459164] [2020-11-07 06:39:22,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:22,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:22,551 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:22,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:22,563 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:39:22,563 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [915459164] [2020-11-07 06:39:22,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:22,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-11-07 06:39:22,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536843581] [2020-11-07 06:39:22,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-07 06:39:22,565 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:22,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-07 06:39:22,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-07 06:39:22,566 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand 8 states. [2020-11-07 06:39:23,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:23,081 INFO L93 Difference]: Finished difference Result 127 states and 140 transitions. [2020-11-07 06:39:23,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-07 06:39:23,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 47 [2020-11-07 06:39:23,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:23,084 INFO L225 Difference]: With dead ends: 127 [2020-11-07 06:39:23,084 INFO L226 Difference]: Without dead ends: 123 [2020-11-07 06:39:23,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:39:23,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-07 06:39:23,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 106. [2020-11-07 06:39:23,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2020-11-07 06:39:23,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2020-11-07 06:39:23,114 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 47 [2020-11-07 06:39:23,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:23,114 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2020-11-07 06:39:23,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-07 06:39:23,114 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2020-11-07 06:39:23,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-11-07 06:39:23,116 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:23,116 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:23,116 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:39:23,117 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:23,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:23,118 INFO L82 PathProgramCache]: Analyzing trace with hash -2099559550, now seen corresponding path program 1 times [2020-11-07 06:39:23,118 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:23,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1157533761] [2020-11-07 06:39:23,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:23,204 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:23,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:23,226 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1157533761] [2020-11-07 06:39:23,227 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:23,227 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:39:23,227 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870446504] [2020-11-07 06:39:23,229 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:39:23,229 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:23,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:39:23,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:39:23,231 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand 7 states. [2020-11-07 06:39:23,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:23,590 INFO L93 Difference]: Finished difference Result 135 states and 151 transitions. [2020-11-07 06:39:23,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:39:23,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2020-11-07 06:39:23,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:23,593 INFO L225 Difference]: With dead ends: 135 [2020-11-07 06:39:23,593 INFO L226 Difference]: Without dead ends: 66 [2020-11-07 06:39:23,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:39:23,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-07 06:39:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-11-07 06:39:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-07 06:39:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2020-11-07 06:39:23,625 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 57 [2020-11-07 06:39:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:23,625 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2020-11-07 06:39:23,626 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:39:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2020-11-07 06:39:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-07 06:39:23,627 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:23,627 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:39:23,627 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:39:23,628 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:23,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:23,628 INFO L82 PathProgramCache]: Analyzing trace with hash -855406281, now seen corresponding path program 1 times [2020-11-07 06:39:23,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:23,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1815561578] [2020-11-07 06:39:23,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:23,731 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:23,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:23,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-07 06:39:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:23,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:23,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1815561578] [2020-11-07 06:39:23,749 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:23,749 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:23,750 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319259174] [2020-11-07 06:39:23,750 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:23,751 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:23,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:23,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:23,752 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand 10 states. [2020-11-07 06:39:24,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:24,378 INFO L93 Difference]: Finished difference Result 93 states and 95 transitions. [2020-11-07 06:39:24,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:39:24,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2020-11-07 06:39:24,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:24,380 INFO L225 Difference]: With dead ends: 93 [2020-11-07 06:39:24,381 INFO L226 Difference]: Without dead ends: 89 [2020-11-07 06:39:24,381 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:39:24,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2020-11-07 06:39:24,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 78. [2020-11-07 06:39:24,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-07 06:39:24,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2020-11-07 06:39:24,411 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 58 [2020-11-07 06:39:24,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:24,412 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2020-11-07 06:39:24,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:24,412 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-11-07 06:39:24,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 06:39:24,413 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:24,414 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:39:24,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 06:39:24,414 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1759920101, now seen corresponding path program 1 times [2020-11-07 06:39:24,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:24,416 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1675302797] [2020-11-07 06:39:24,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:24,571 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:24,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:24,595 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:24,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1675302797] [2020-11-07 06:39:24,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:24,596 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:24,596 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658968094] [2020-11-07 06:39:24,596 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:24,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:24,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:24,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:24,597 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 10 states. [2020-11-07 06:39:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:25,218 INFO L93 Difference]: Finished difference Result 107 states and 109 transitions. [2020-11-07 06:39:25,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:39:25,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2020-11-07 06:39:25,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:25,221 INFO L225 Difference]: With dead ends: 107 [2020-11-07 06:39:25,222 INFO L226 Difference]: Without dead ends: 103 [2020-11-07 06:39:25,222 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:39:25,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2020-11-07 06:39:25,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 78. [2020-11-07 06:39:25,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2020-11-07 06:39:25,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2020-11-07 06:39:25,249 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 59 [2020-11-07 06:39:25,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:25,253 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2020-11-07 06:39:25,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:25,253 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2020-11-07 06:39:25,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-11-07 06:39:25,254 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:25,254 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 06:39:25,255 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 06:39:25,255 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:25,255 INFO L82 PathProgramCache]: Analyzing trace with hash 155171771, now seen corresponding path program 1 times [2020-11-07 06:39:25,256 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:25,257 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [124471533] [2020-11-07 06:39:25,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:25,442 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:25,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:25,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-11-07 06:39:25,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 06:39:25,478 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [124471533] [2020-11-07 06:39:25,479 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:25,479 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:39:25,480 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717323255] [2020-11-07 06:39:25,483 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:39:25,483 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:25,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:39:25,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:39:25,485 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 10 states. [2020-11-07 06:39:26,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:26,095 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2020-11-07 06:39:26,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-07 06:39:26,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 59 [2020-11-07 06:39:26,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:26,097 INFO L225 Difference]: With dead ends: 105 [2020-11-07 06:39:26,098 INFO L226 Difference]: Without dead ends: 101 [2020-11-07 06:39:26,099 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:39:26,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2020-11-07 06:39:26,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 76. [2020-11-07 06:39:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2020-11-07 06:39:26,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 78 transitions. [2020-11-07 06:39:26,117 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 78 transitions. Word has length 59 [2020-11-07 06:39:26,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:26,118 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 78 transitions. [2020-11-07 06:39:26,118 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:39:26,118 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2020-11-07 06:39:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 06:39:26,119 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:39:26,119 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:39:26,119 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 06:39:26,119 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:39:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:39:26,120 INFO L82 PathProgramCache]: Analyzing trace with hash 123956103, now seen corresponding path program 2 times [2020-11-07 06:39:26,120 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:39:26,121 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1367389317] [2020-11-07 06:39:26,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:39:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:26,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:39:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:26,221 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2020-11-07 06:39:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:26,225 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:39:26,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:39:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 06:39:26,247 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1367389317] [2020-11-07 06:39:26,248 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:39:26,248 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-11-07 06:39:26,248 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004955199] [2020-11-07 06:39:26,248 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-07 06:39:26,248 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:39:26,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-07 06:39:26,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-11-07 06:39:26,249 INFO L87 Difference]: Start difference. First operand 76 states and 78 transitions. Second operand 7 states. [2020-11-07 06:39:26,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:39:26,540 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2020-11-07 06:39:26,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-07 06:39:26,541 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2020-11-07 06:39:26,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:39:26,542 INFO L225 Difference]: With dead ends: 76 [2020-11-07 06:39:26,542 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:39:26,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:39:26,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:39:26,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:39:26,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:39:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:39:26,544 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2020-11-07 06:39:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:39:26,544 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:39:26,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-07 06:39:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:39:26,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:39:26,545 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 06:39:26,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:39:27,630 WARN L194 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 23 [2020-11-07 06:39:28,692 WARN L194 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 33 [2020-11-07 06:39:28,876 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,876 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,876 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,877 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,877 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,877 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,877 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:28,877 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:28,877 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,878 INFO L269 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,878 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,878 INFO L269 CegarLoopResult]: At program point L12-2(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,878 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:39:28,878 INFO L269 CegarLoopResult]: At program point L12-3(line 12) the Hoare annotation is: true [2020-11-07 06:39:28,878 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:39:28,879 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:39:28,879 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:39:28,879 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:39:28,879 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:39:28,879 INFO L266 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-11-07 06:39:28,880 INFO L266 CegarLoopResult]: For program point L15-1(line 15) no Hoare annotation was computed. [2020-11-07 06:39:28,880 INFO L266 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:28,881 INFO L266 CegarLoopResult]: For program point L15-3(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:28,881 INFO L266 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2020-11-07 06:39:28,881 INFO L262 CegarLoopResult]: At program point L35-2(line 35) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (= |main_#t~post4| 0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,883 INFO L262 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,883 INFO L269 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: true [2020-11-07 06:39:28,883 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0)) [2020-11-07 06:39:28,883 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 24 52) the Hoare annotation is: true [2020-11-07 06:39:28,884 INFO L262 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (= main_~j~0 0) (= |main_#t~post6| 0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,884 INFO L262 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (and (<= main_~n~0 main_~j~0) (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (= |main_#t~post6| 0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,884 INFO L262 CegarLoopResult]: At program point L40(lines 40 43) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,885 INFO L262 CegarLoopResult]: At program point L40-2(lines 34 44) the Hoare annotation is: (let ((.cse0 (<= 4000 main_~c1~0)) (.cse1 (<= 2000 main_~c2~0)) (.cse2 (<= 10000 main_~c3~0))) (or (and .cse0 (= main_~k~0 0) (= main_~i~0 0) .cse1 .cse2) (and .cse0 (<= 1 main_~i~0) (<= 2000 main_~k~0) .cse1 (<= main_~n~0 1) .cse2))) [2020-11-07 06:39:28,885 INFO L262 CegarLoopResult]: At program point L36(line 36) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,885 INFO L262 CegarLoopResult]: At program point L36-1(line 36) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,886 INFO L262 CegarLoopResult]: At program point L36-2(line 36) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,886 INFO L262 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,886 INFO L262 CegarLoopResult]: At program point L28(line 28) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,886 INFO L262 CegarLoopResult]: At program point L28-1(line 28) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,886 INFO L269 CegarLoopResult]: At program point L24(lines 24 52) the Hoare annotation is: true [2020-11-07 06:39:28,886 INFO L262 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (and (<= main_~n~0 main_~j~0) (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,887 INFO L262 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (and (<= main_~n~0 main_~j~0) (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (<= 2000 |main_#t~post7|) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,887 INFO L262 CegarLoopResult]: At program point L49-2(line 49) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= main_~n~0 main_~j~0) (<= 1 main_~i~0) (<= 1999 main_~k~0) (<= 2000 |main_#t~post7|) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,887 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,887 INFO L262 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,888 INFO L269 CegarLoopResult]: At program point L37-1(line 37) the Hoare annotation is: true [2020-11-07 06:39:28,888 INFO L262 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,888 INFO L262 CegarLoopResult]: At program point L29(line 29) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,888 INFO L262 CegarLoopResult]: At program point L29-1(line 29) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,889 INFO L262 CegarLoopResult]: At program point L29-2(line 29) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,889 INFO L269 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-11-07 06:39:28,889 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 24 52) the Hoare annotation is: true [2020-11-07 06:39:28,889 INFO L262 CegarLoopResult]: At program point L46-2(lines 46 50) the Hoare annotation is: (let ((.cse0 (<= 4000 main_~c1~0)) (.cse1 (<= 1 main_~i~0)) (.cse2 (<= 2000 main_~c2~0)) (.cse3 (<= main_~n~0 1)) (.cse4 (<= 10000 main_~c3~0)) (.cse5 (= main_~j~0 0))) (or (and (<= main_~n~0 main_~j~0) .cse0 .cse1 (<= 1999 main_~k~0) .cse2 .cse3 .cse4) (and .cse0 .cse1 (<= 2000 main_~k~0) .cse5 .cse2 .cse3 .cse4) (and (<= main_~n~0 0) (= main_~i~0 0) .cse5))) [2020-11-07 06:39:28,889 INFO L269 CegarLoopResult]: At program point L46-3(lines 46 50) the Hoare annotation is: true [2020-11-07 06:39:28,890 INFO L262 CegarLoopResult]: At program point L38(lines 38 43) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,890 INFO L262 CegarLoopResult]: At program point L34-2(lines 34 44) the Hoare annotation is: (or (and (<= main_~n~0 0) (= main_~i~0 0)) (and (<= 4000 main_~c1~0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0))) [2020-11-07 06:39:28,890 INFO L262 CegarLoopResult]: At program point L30(line 30) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,890 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 24 52) the Hoare annotation is: true [2020-11-07 06:39:28,890 INFO L262 CegarLoopResult]: At program point L30-1(line 30) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,891 INFO L262 CegarLoopResult]: At program point L30-2(line 30) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,891 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (<= 4000 main_~c1~0) [2020-11-07 06:39:28,891 INFO L262 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~j~0 0) (<= 1 main_~i~0) (<= 2000 main_~k~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,891 INFO L262 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (and (<= 4000 main_~c1~0) (<= 2000 main_~k~0) (<= 1 main_~i~0) (= main_~j~0 0) (<= 2000 main_~c2~0) (<= main_~n~0 1) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,891 INFO L262 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,892 INFO L262 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (<= 1 main_~i~0) (<= main_~n~0 1) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,892 INFO L262 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (= main_~i~0 0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,892 INFO L262 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: (and (<= 4000 main_~c1~0) (= main_~k~0 0) (= main_~i~0 0) (= |main_#t~post4| 0) (<= 2000 main_~c2~0) (<= 10000 main_~c3~0)) [2020-11-07 06:39:28,892 INFO L262 CegarLoopResult]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:28,892 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2020-11-07 06:39:28,893 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:39:28,893 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:39:28,893 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:39:28,893 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:39:28,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:39:28 BoogieIcfgContainer [2020-11-07 06:39:28,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:39:28,936 INFO L168 Benchmark]: Toolchain (without parser) took 10369.58 ms. Allocated memory was 152.0 MB in the beginning and 282.1 MB in the end (delta: 130.0 MB). Free memory was 128.4 MB in the beginning and 144.7 MB in the end (delta: -16.3 MB). Peak memory consumption was 130.3 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:28,937 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 152.0 MB. Free memory is still 127.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:39:28,938 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.56 ms. Allocated memory is still 152.0 MB. Free memory was 127.8 MB in the beginning and 118.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:28,941 INFO L168 Benchmark]: Boogie Preprocessor took 71.18 ms. Allocated memory is still 152.0 MB. Free memory was 118.1 MB in the beginning and 116.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:28,945 INFO L168 Benchmark]: RCFGBuilder took 546.13 ms. Allocated memory is still 152.0 MB. Free memory was 116.5 MB in the beginning and 131.2 MB in the end (delta: -14.7 MB). Peak memory consumption was 17.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:28,946 INFO L168 Benchmark]: TraceAbstraction took 9338.97 ms. Allocated memory was 152.0 MB in the beginning and 282.1 MB in the end (delta: 130.0 MB). Free memory was 130.7 MB in the beginning and 144.7 MB in the end (delta: -14.1 MB). Peak memory consumption was 133.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:39:28,956 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.23 ms. Allocated memory is still 152.0 MB. Free memory is still 127.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 395.56 ms. Allocated memory is still 152.0 MB. Free memory was 127.8 MB in the beginning and 118.1 MB in the end (delta: 9.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 71.18 ms. Allocated memory is still 152.0 MB. Free memory was 118.1 MB in the beginning and 116.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 546.13 ms. Allocated memory is still 152.0 MB. Free memory was 116.5 MB in the beginning and 131.2 MB in the end (delta: -14.7 MB). Peak memory consumption was 17.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9338.97 ms. Allocated memory was 152.0 MB in the beginning and 282.1 MB in the end (delta: 130.0 MB). Free memory was 130.7 MB in the beginning and 144.7 MB in the end (delta: -14.1 MB). Peak memory consumption was 133.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: 34]: Loop Invariant Derived loop invariant: ((((4000 <= c1 && k == 0) && i == 0) && 2000 <= c2) && 10000 <= c3) || (((((4000 <= c1 && 1 <= i) && 2000 <= k) && 2000 <= c2) && n <= 1) && 10000 <= c3) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: (((((((n <= j && 4000 <= c1) && 1 <= i) && 1999 <= k) && 2000 <= c2) && n <= 1) && 10000 <= c3) || ((((((4000 <= c1 && 1 <= i) && 2000 <= k) && j == 0) && 2000 <= c2) && n <= 1) && 10000 <= c3)) || ((n <= 0 && i == 0) && j == 0) - 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: \old(cond) == 0 || !(cond == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 73 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6.8s, OverallIterations: 10, TraceHistogramMax: 3, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 630 SDtfs, 910 SDslu, 518 SDs, 0 SdLazy, 2101 SolverSat, 138 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=5, 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, 10 MinimizatonAttempts, 120 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 68 LocationsWithAnnotation, 158 PreInvPairs, 191 NumberOfFragments, 702 HoareAnnotationTreeSize, 158 FomulaSimplifications, 21383 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 68 FomulaSimplificationsInter, 2334 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 515 NumberOfCodeBlocks, 515 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 505 ConstructedInterpolants, 0 QuantifiedInterpolants, 78925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 36/50 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...