/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-crafted/simple_array_index_value_4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 06:36:17,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 06:36:17,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 06:36:17,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 06:36:17,211 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 06:36:17,214 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 06:36:17,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 06:36:17,225 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 06:36:17,228 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 06:36:17,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 06:36:17,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 06:36:17,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 06:36:17,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 06:36:17,240 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 06:36:17,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 06:36:17,244 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 06:36:17,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 06:36:17,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 06:36:17,269 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 06:36:17,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 06:36:17,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 06:36:17,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 06:36:17,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 06:36:17,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 06:36:17,293 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 06:36:17,293 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 06:36:17,294 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 06:36:17,296 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 06:36:17,296 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 06:36:17,297 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 06:36:17,298 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 06:36:17,298 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 06:36:17,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 06:36:17,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 06:36:17,302 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 06:36:17,302 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 06:36:17,303 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 06:36:17,303 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 06:36:17,304 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 06:36:17,305 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 06:36:17,305 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 06:36:17,307 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:36:17,328 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 06:36:17,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 06:36:17,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 06:36:17,335 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 06:36:17,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 06:36:17,336 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 06:36:17,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 06:36:17,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 06:36:17,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 06:36:17,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 06:36:17,338 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 06:36:17,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 06:36:17,338 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 06:36:17,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 06:36:17,339 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 06:36:17,339 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 06:36:17,339 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 06:36:17,340 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 06:36:17,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 06:36:17,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 06:36:17,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 06:36:17,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 06:36:17,341 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:36:17,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 06:36:17,794 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 06:36:17,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 06:36:17,799 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 06:36:17,800 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 06:36:17,801 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2020-11-07 06:36:17,891 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5266ae5b/be37e30d73084d9dba79aa1f3d8179be/FLAG7ee77a434 [2020-11-07 06:36:18,659 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 06:36:18,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2020-11-07 06:36:18,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5266ae5b/be37e30d73084d9dba79aa1f3d8179be/FLAG7ee77a434 [2020-11-07 06:36:19,022 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c5266ae5b/be37e30d73084d9dba79aa1f3d8179be [2020-11-07 06:36:19,029 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 06:36:19,042 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 06:36:19,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 06:36:19,048 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 06:36:19,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 06:36:19,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,058 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f0655dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19, skipping insertion in model container [2020-11-07 06:36:19,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,069 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 06:36:19,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 06:36:19,384 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:36:19,396 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 06:36:19,443 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 06:36:19,469 INFO L208 MainTranslator]: Completed translation [2020-11-07 06:36:19,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19 WrapperNode [2020-11-07 06:36:19,470 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 06:36:19,471 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 06:36:19,472 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 06:36:19,472 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 06:36:19,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,490 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,514 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,515 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,537 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,547 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,555 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (1/1) ... [2020-11-07 06:36:19,559 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 06:36:19,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 06:36:19,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 06:36:19,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 06:36:19,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (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:36:19,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 06:36:19,662 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 06:36:19,662 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 06:36:19,662 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-11-07 06:36:19,662 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-07 06:36:19,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 06:36:19,663 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 06:36:19,663 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 06:36:19,663 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-07 06:36:19,663 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-07 06:36:19,664 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 06:36:19,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 06:36:19,664 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-11-07 06:36:19,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-07 06:36:19,665 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 06:36:19,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 06:36:19,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 06:36:19,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 06:36:19,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 06:36:19,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 06:36:19,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 06:36:19,666 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 06:36:20,235 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 06:36:20,236 INFO L298 CfgBuilder]: Removed 2 assume(true) statements. [2020-11-07 06:36:20,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:36:20 BoogieIcfgContainer [2020-11-07 06:36:20,238 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 06:36:20,242 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 06:36:20,242 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 06:36:20,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 06:36:20,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 06:36:19" (1/3) ... [2020-11-07 06:36:20,248 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f29bf2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:36:20, skipping insertion in model container [2020-11-07 06:36:20,248 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 06:36:19" (2/3) ... [2020-11-07 06:36:20,249 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f29bf2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 06:36:20, skipping insertion in model container [2020-11-07 06:36:20,249 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 06:36:20" (3/3) ... [2020-11-07 06:36:20,250 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2020-11-07 06:36:20,268 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 06:36:20,273 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 06:36:20,286 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 06:36:20,307 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 06:36:20,307 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 06:36:20,308 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 06:36:20,308 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 06:36:20,308 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 06:36:20,308 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 06:36:20,308 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 06:36:20,308 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 06:36:20,325 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states. [2020-11-07 06:36:20,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-11-07 06:36:20,335 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:20,336 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] [2020-11-07 06:36:20,337 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:20,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:20,344 INFO L82 PathProgramCache]: Analyzing trace with hash -77521331, now seen corresponding path program 1 times [2020-11-07 06:36:20,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:20,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2144631889] [2020-11-07 06:36:20,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:20,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:20,743 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:20,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:20,762 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 06:36:20,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:20,770 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-07 06:36:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-07 06:36:20,845 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2144631889] [2020-11-07 06:36:20,847 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:20,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 06:36:20,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546917445] [2020-11-07 06:36:20,854 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 06:36:20,855 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 06:36:20,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-11-07 06:36:20,874 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 9 states. [2020-11-07 06:36:21,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:21,713 INFO L93 Difference]: Finished difference Result 149 states and 185 transitions. [2020-11-07 06:36:21,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-07 06:36:21,715 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2020-11-07 06:36:21,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:21,726 INFO L225 Difference]: With dead ends: 149 [2020-11-07 06:36:21,726 INFO L226 Difference]: Without dead ends: 85 [2020-11-07 06:36:21,731 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-11-07 06:36:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-07 06:36:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 66. [2020-11-07 06:36:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-07 06:36:21,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2020-11-07 06:36:21,790 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 36 [2020-11-07 06:36:21,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:21,791 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2020-11-07 06:36:21,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 06:36:21,791 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2020-11-07 06:36:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-07 06:36:21,793 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:21,794 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] [2020-11-07 06:36:21,794 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 06:36:21,794 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:21,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:21,796 INFO L82 PathProgramCache]: Analyzing trace with hash -2039025071, now seen corresponding path program 1 times [2020-11-07 06:36:21,797 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:21,797 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [752415545] [2020-11-07 06:36:21,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:21,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:21,933 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:21,960 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 06:36:21,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:21,982 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-07 06:36:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:22,001 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-07 06:36:22,002 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [752415545] [2020-11-07 06:36:22,002 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 06:36:22,002 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-07 06:36:22,003 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752256211] [2020-11-07 06:36:22,012 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-07 06:36:22,012 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:22,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-07 06:36:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:36:22,014 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 4 states. [2020-11-07 06:36:22,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:22,180 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2020-11-07 06:36:22,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-07 06:36:22,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2020-11-07 06:36:22,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:22,183 INFO L225 Difference]: With dead ends: 99 [2020-11-07 06:36:22,184 INFO L226 Difference]: Without dead ends: 78 [2020-11-07 06:36:22,186 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-07 06:36:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-07 06:36:22,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 66. [2020-11-07 06:36:22,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-11-07 06:36:22,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2020-11-07 06:36:22,222 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 40 [2020-11-07 06:36:22,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:22,223 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2020-11-07 06:36:22,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-07 06:36:22,223 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2020-11-07 06:36:22,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-11-07 06:36:22,228 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:22,229 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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:36:22,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 06:36:22,231 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:22,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:22,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1767171422, now seen corresponding path program 1 times [2020-11-07 06:36:22,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:22,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [891386029] [2020-11-07 06:36:22,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:22,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:22,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:22,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 06:36:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:22,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-07 06:36:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:22,763 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:36:22,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:22,773 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-07 06:36:22,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 06:36:22,800 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [891386029] [2020-11-07 06:36:22,800 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:22,800 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 06:36:22,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898050154] [2020-11-07 06:36:22,801 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 06:36:22,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:22,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 06:36:22,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2020-11-07 06:36:22,803 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 12 states. [2020-11-07 06:36:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:23,508 INFO L93 Difference]: Finished difference Result 92 states and 97 transitions. [2020-11-07 06:36:23,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:36:23,509 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2020-11-07 06:36:23,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:23,512 INFO L225 Difference]: With dead ends: 92 [2020-11-07 06:36:23,512 INFO L226 Difference]: Without dead ends: 88 [2020-11-07 06:36:23,517 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2020-11-07 06:36:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-11-07 06:36:23,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 65. [2020-11-07 06:36:23,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-11-07 06:36:23,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2020-11-07 06:36:23,541 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 58 [2020-11-07 06:36:23,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:23,542 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2020-11-07 06:36:23,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 06:36:23,542 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2020-11-07 06:36:23,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-07 06:36:23,544 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:23,544 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2020-11-07 06:36:23,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 06:36:23,545 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:23,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:23,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1205942046, now seen corresponding path program 1 times [2020-11-07 06:36:23,546 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:23,546 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [438131059] [2020-11-07 06:36:23,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:23,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:24,727 WARN L194 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 39 [2020-11-07 06:36:25,033 WARN L194 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 37 [2020-11-07 06:36:25,233 WARN L194 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 48 [2020-11-07 06:36:25,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:25,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:25,515 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 06:36:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:25,525 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-07 06:36:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:25,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:36:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:25,609 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-07 06:36:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-07 06:36:25,653 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [438131059] [2020-11-07 06:36:25,654 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:25,654 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2020-11-07 06:36:25,654 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939711156] [2020-11-07 06:36:25,655 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-07 06:36:25,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:25,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-07 06:36:25,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2020-11-07 06:36:25,657 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand 19 states. [2020-11-07 06:36:31,484 WARN L194 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 53 [2020-11-07 06:36:31,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:31,889 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2020-11-07 06:36:31,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-11-07 06:36:31,892 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2020-11-07 06:36:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:31,897 INFO L225 Difference]: With dead ends: 108 [2020-11-07 06:36:31,898 INFO L226 Difference]: Without dead ends: 104 [2020-11-07 06:36:31,904 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 259 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=153, Invalid=903, Unknown=0, NotChecked=0, Total=1056 [2020-11-07 06:36:31,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2020-11-07 06:36:31,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2020-11-07 06:36:31,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-07 06:36:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 97 transitions. [2020-11-07 06:36:31,957 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 97 transitions. Word has length 62 [2020-11-07 06:36:31,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:31,957 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 97 transitions. [2020-11-07 06:36:31,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-07 06:36:31,958 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 97 transitions. [2020-11-07 06:36:31,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2020-11-07 06:36:31,965 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:31,965 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:31,965 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 06:36:31,966 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:31,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:31,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1571254182, now seen corresponding path program 1 times [2020-11-07 06:36:31,968 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:31,968 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1744007429] [2020-11-07 06:36:31,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:32,431 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:32,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:32,438 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 06:36:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:32,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-07 06:36:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:32,444 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:36:32,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:32,448 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-07 06:36:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:32,453 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-11-07 06:36:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 06:36:32,476 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1744007429] [2020-11-07 06:36:32,476 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:32,476 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-11-07 06:36:32,476 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217137126] [2020-11-07 06:36:32,477 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-07 06:36:32,477 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:32,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-07 06:36:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-11-07 06:36:32,478 INFO L87 Difference]: Start difference. First operand 92 states and 97 transitions. Second operand 10 states. [2020-11-07 06:36:44,079 WARN L194 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2020-11-07 06:36:46,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:36:46,197 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2020-11-07 06:36:46,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-07 06:36:46,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 78 [2020-11-07 06:36:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:36:46,201 INFO L225 Difference]: With dead ends: 113 [2020-11-07 06:36:46,201 INFO L226 Difference]: Without dead ends: 73 [2020-11-07 06:36:46,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=63, Invalid=315, Unknown=2, NotChecked=0, Total=380 [2020-11-07 06:36:46,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2020-11-07 06:36:46,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2020-11-07 06:36:46,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2020-11-07 06:36:46,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 76 transitions. [2020-11-07 06:36:46,225 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 76 transitions. Word has length 78 [2020-11-07 06:36:46,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:36:46,225 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 76 transitions. [2020-11-07 06:36:46,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-11-07 06:36:46,225 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 76 transitions. [2020-11-07 06:36:46,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2020-11-07 06:36:46,227 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 06:36:46,227 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 06:36:46,227 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 06:36:46,228 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 06:36:46,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 06:36:46,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1631982413, now seen corresponding path program 2 times [2020-11-07 06:36:46,229 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 06:36:46,229 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1887156872] [2020-11-07 06:36:46,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 06:36:46,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:49,134 WARN L194 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 18 [2020-11-07 06:36:49,358 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2020-11-07 06:36:49,661 WARN L194 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 41 [2020-11-07 06:36:50,121 WARN L194 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 44 [2020-11-07 06:36:50,348 WARN L194 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 45 [2020-11-07 06:36:50,806 WARN L194 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 206 DAG size of output: 56 [2020-11-07 06:36:55,329 WARN L194 SmtUtils]: Spent 4.41 s on a formula simplification. DAG size of input: 97 DAG size of output: 49 [2020-11-07 06:36:55,696 WARN L194 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 73 [2020-11-07 06:36:56,168 WARN L194 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 65 [2020-11-07 06:36:56,553 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 06:36:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,559 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2020-11-07 06:36:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,562 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-11-07 06:36:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2020-11-07 06:36:56,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,691 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-11-07 06:36:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2020-11-07 06:36:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2020-11-07 06:36:56,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 06:36:56,805 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 06:36:56,805 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1887156872] [2020-11-07 06:36:56,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 06:36:56,807 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2020-11-07 06:36:56,807 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817418982] [2020-11-07 06:36:56,808 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-11-07 06:36:56,808 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 06:36:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-11-07 06:36:56,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=465, Unknown=1, NotChecked=0, Total=552 [2020-11-07 06:36:56,810 INFO L87 Difference]: Start difference. First operand 73 states and 76 transitions. Second operand 24 states. [2020-11-07 06:37:11,212 WARN L194 SmtUtils]: Spent 2.20 s on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2020-11-07 06:37:33,003 WARN L194 SmtUtils]: Spent 17.32 s on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2020-11-07 06:37:50,280 WARN L194 SmtUtils]: Spent 12.82 s on a formula simplification. DAG size of input: 117 DAG size of output: 66 [2020-11-07 06:37:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 06:37:53,074 INFO L93 Difference]: Finished difference Result 73 states and 76 transitions. [2020-11-07 06:37:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-11-07 06:37:53,074 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 84 [2020-11-07 06:37:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 06:37:53,076 INFO L225 Difference]: With dead ends: 73 [2020-11-07 06:37:53,076 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 06:37:53,079 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 447 ImplicationChecksByTransitivity, 52.4s TimeCoverageRelationStatistics Valid=255, Invalid=1463, Unknown=4, NotChecked=0, Total=1722 [2020-11-07 06:37:53,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 06:37:53,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 06:37:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 06:37:53,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 06:37:53,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2020-11-07 06:37:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 06:37:53,080 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 06:37:53,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-11-07 06:37:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 06:37:53,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 06:37:53,081 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 06:37:53,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 06:37:53,752 WARN L194 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2020-11-07 06:37:53,920 WARN L194 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2020-11-07 06:37:56,118 WARN L194 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2020-11-07 06:37:58,495 WARN L194 SmtUtils]: Spent 2.34 s on a formula simplification. DAG size of input: 91 DAG size of output: 65 [2020-11-07 06:38:06,940 WARN L194 SmtUtils]: Spent 8.41 s on a formula simplification. DAG size of input: 93 DAG size of output: 59 [2020-11-07 06:38:11,280 WARN L194 SmtUtils]: Spent 4.27 s on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2020-11-07 06:38:13,481 WARN L194 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-11-07 06:38:38,691 WARN L194 SmtUtils]: Spent 25.15 s on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2020-11-07 06:38:47,225 WARN L194 SmtUtils]: Spent 8.53 s on a formula simplification. DAG size of input: 117 DAG size of output: 76 [2020-11-07 06:38:47,374 WARN L194 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 49 [2020-11-07 06:38:49,659 WARN L194 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2020-11-07 06:38:53,948 WARN L194 SmtUtils]: Spent 4.28 s on a formula simplification. DAG size of input: 70 DAG size of output: 48 [2020-11-07 06:38:53,957 INFO L269 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,957 INFO L269 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,957 INFO L269 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,957 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,957 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,958 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,958 INFO L269 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,958 INFO L269 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,958 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:38:53,958 INFO L269 CegarLoopResult]: At program point L18-3(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,958 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 06:38:53,958 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,958 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:38:53,959 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 06:38:53,959 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:38:53,959 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 06:38:53,959 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 06:38:53,959 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 06:38:53,959 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 06:38:53,959 INFO L269 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 20 22) the Hoare annotation is: true [2020-11-07 06:38:53,960 INFO L262 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2020-11-07 06:38:53,960 INFO L262 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2020-11-07 06:38:53,960 INFO L262 CegarLoopResult]: At program point L21-3(lines 20 22) the Hoare annotation is: (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0))) [2020-11-07 06:38:53,960 INFO L262 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 20 22) the Hoare annotation is: (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0))) [2020-11-07 06:38:53,960 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 33 61) the Hoare annotation is: true [2020-11-07 06:38:53,961 INFO L262 CegarLoopResult]: At program point L56(line 56) the Hoare annotation is: (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)) [2020-11-07 06:38:53,961 INFO L262 CegarLoopResult]: At program point L56-1(line 56) the Hoare annotation is: (let ((.cse0 (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296)) (.cse1 (* main_~index1~0 (- 1)))) (and (<= |main_#t~post11| (+ (* 4294967296 (div (+ |main_#t~post11| .cse0 .cse1 1) 4294967296)) 4294967294)) (<= main_~index2~0 (+ (* 4294967296 (div (+ .cse0 main_~index2~0 .cse1 1) 4294967296)) 4294967294)))) [2020-11-07 06:38:53,961 INFO L262 CegarLoopResult]: At program point L56-2(line 56) the Hoare annotation is: (and (<= |main_#t~post11| (+ (* 4294967296 (div (+ |main_#t~post11| (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)) (<= (+ (* 4294967296 (div (+ (* (div main_~index2~0 4294967296) 4294967296) (* main_~index2~0 (- 1)) main_~index1~0 4294967295) 4294967296)) 1) main_~index1~0)) [2020-11-07 06:38:53,961 INFO L262 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse4 (div main_~index2~0 4294967296))) (let ((.cse5 (* 4294967296 .cse4)) (.cse3 (div main_~index1~0 4294967296))) (and (let ((.cse2 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse1 (select .cse2 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse0 (select .cse2 (+ (* .cse3 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (+ .cse0 (* 4294967296 (div (+ (* .cse0 (- 1)) .cse1 4294967295) 4294967296)))) .cse1))) (<= main_~index2~0 (+ .cse5 99999)) (<= (+ .cse5 main_~index1~0 1) (+ (* 4294967296 .cse3) main_~index2~0))))) [2020-11-07 06:38:53,962 INFO L262 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: (let ((.cse8 (div main_~index2~0 4294967296))) (let ((.cse2 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (* .cse8 (- 17179869184))) (.cse4 (* main_~index2~0 4))) (let ((.cse0 (select .cse2 (+ .cse3 .cse4 |main_~#array~0.offset|))) (.cse5 (* 4294967296 .cse8)) (.cse7 (div main_~index1~0 4294967296))) (and (or (<= .cse0 (let ((.cse1 (select .cse2 (+ .cse3 .cse4 |main_~#array~0.offset| (- 4))))) (+ (* 4294967296 (div (+ .cse0 (* .cse1 (- 1))) 4294967296)) .cse1))) (< (+ .cse5 |main_#t~post7| 1) (+ (* 4294967296 (div |main_#t~post7| 4294967296)) main_~index2~0))) (<= (let ((.cse6 (select .cse2 (+ (* .cse7 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (+ .cse6 (* 4294967296 (div (+ (* .cse6 (- 1)) .cse0 4294967295) 4294967296)))) .cse0) (<= main_~index2~0 (+ .cse5 99999)) (<= (+ .cse5 main_~index1~0 1) (+ (* 4294967296 .cse7) main_~index2~0)) (<= (* 4294967296 (div (+ (* .cse8 4294967296) |main_#t~post7| (* main_~index2~0 (- 1)) 4294967296) 4294967296)) |main_#t~post7|))))) [2020-11-07 06:38:53,962 INFO L262 CegarLoopResult]: At program point L48-2(line 48) the Hoare annotation is: (let ((.cse11 (div main_~index2~0 4294967296))) (let ((.cse3 (select |#memory_int| |main_~#array~0.base|)) (.cse4 (* .cse11 (- 17179869184))) (.cse5 (* main_~index2~0 4))) (let ((.cse2 (select .cse3 (+ .cse4 .cse5 |main_~#array~0.offset| (- 4))))) (let ((.cse1 (* .cse2 (- 1))) (.cse6 (* 4294967296 .cse11)) (.cse7 (* .cse11 4294967296)) (.cse10 (* main_~index2~0 (- 1)))) (and (or (let ((.cse0 (select .cse3 (+ .cse4 .cse5 |main_~#array~0.offset|)))) (<= .cse0 (+ (* 4294967296 (div (+ .cse0 .cse1) 4294967296)) .cse2))) (< (+ .cse6 |main_#t~post7| 1) (+ (* 4294967296 (div |main_#t~post7| 4294967296)) main_~index2~0))) (let ((.cse8 (div main_~index1~0 4294967296))) (or (not (= (+ .cse7 main_~index1~0) (+ (* .cse8 4294967296) main_~index2~0))) (let ((.cse9 (select .cse3 (+ (* .cse8 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= .cse9 (+ .cse2 (* 4294967296 (div (+ .cse9 .cse1) 4294967296))))))) (<= main_~index2~0 (+ .cse6 99999)) (<= (+ (* 4294967296 (div (+ .cse7 .cse10 main_~index1~0 4294967295) 4294967296)) 1) main_~index1~0) (<= (* 4294967296 (div (+ .cse7 |main_#t~post7| .cse10 4294967296) 4294967296)) |main_#t~post7|)))))) [2020-11-07 06:38:53,962 INFO L262 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (= main_~loop_entered~0 0) [2020-11-07 06:38:53,963 INFO L262 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (= main_~loop_entered~0 0) [2020-11-07 06:38:53,963 INFO L262 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (<= (+ (* 4294967296 (div (+ (* (div main_~index2~0 4294967296) 4294967296) (* main_~index2~0 (- 1)) main_~index1~0 4294967295) 4294967296)) 1) main_~index1~0) [2020-11-07 06:38:53,963 INFO L262 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: (let ((.cse0 (* (div main_~index2~0 4294967296) 4294967296)) (.cse1 (* main_~index2~0 (- 1)))) (and (<= (+ (* 4294967296 (div (+ .cse0 |main_#t~post12| .cse1 4294967295) 4294967296)) 1) |main_#t~post12|) (<= (+ (* 4294967296 (div (+ .cse0 .cse1 main_~index1~0 4294967295) 4294967296)) 1) main_~index1~0))) [2020-11-07 06:38:53,963 INFO L262 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse0 (div main_~index2~0 4294967296))) (and (<= (+ (* 4294967296 (div (+ (* .cse0 4294967296) |main_#t~post12| (* main_~index2~0 (- 1)) 4294967295) 4294967296)) 1) |main_#t~post12|) (<= (+ (* 4294967296 .cse0) main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0)))) [2020-11-07 06:38:53,963 INFO L269 CegarLoopResult]: At program point L53(lines 53 59) the Hoare annotation is: true [2020-11-07 06:38:53,964 INFO L262 CegarLoopResult]: At program point L49(line 49) the Hoare annotation is: (let ((.cse2 (div main_~index2~0 4294967296))) (and (let ((.cse1 (* main_~index2~0 4)) (.cse0 (div main_~index1~0 4294967296)) (.cse3 (* main_~index1~0 4))) (or (not (= (+ (* .cse0 17179869184) .cse1) (+ (* .cse2 17179869184) .cse3))) (let ((.cse6 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse4 (select .cse6 (+ (* .cse0 (- 17179869184)) .cse3 |main_~#array~0.offset|)))) (<= .cse4 (let ((.cse5 (select .cse6 (+ (* .cse2 (- 17179869184)) .cse1 |main_~#array~0.offset| (- 4))))) (+ .cse5 (* 4294967296 (div (+ .cse4 (* .cse5 (- 1))) 4294967296))))))))) (<= main_~index2~0 (+ (* 4294967296 .cse2) 99999)) (<= (+ (* 4294967296 (div (+ (* .cse2 4294967296) (* main_~index2~0 (- 1)) main_~index1~0 4294967295) 4294967296)) 1) main_~index1~0))) [2020-11-07 06:38:53,964 INFO L262 CegarLoopResult]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse5 (div main_~index2~0 4294967296)) (.cse4 (select |#memory_int| |main_~#array~0.base|)) (.cse1 (div main_~index1~0 4294967296))) (let ((.cse2 (select .cse4 (+ (* .cse1 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|))) (.cse0 (* .cse5 4294967296))) (and (or (not (= (+ .cse0 main_~index1~0) (+ (* .cse1 4294967296) main_~index2~0))) (<= .cse2 (let ((.cse3 (select .cse4 (+ (* .cse5 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset| (- 4))))) (+ .cse3 (* 4294967296 (div (+ .cse2 (* .cse3 (- 1))) 4294967296)))))) (let ((.cse6 (div (+ |main_#t~post8| 4294867296) 4294967296))) (or (<= (+ (* 4294967296 .cse6) main_~index1~0 1) (+ |main_#t~post8| (* 4294967296 .cse1))) (<= .cse2 (let ((.cse7 (select .cse4 (+ (* |main_#t~post8| 4) (* .cse6 (- 17179869184)) |main_~#array~0.offset| (- 4))))) (+ .cse7 (* 4294967296 (div (+ .cse2 (* .cse7 (- 1))) 4294967296))))))) (<= main_~index2~0 (+ (* 4294967296 .cse5) 99999)) (<= |main_#t~post8| (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) |main_#t~post8| (* main_~index1~0 (- 1))) 4294967296)) 99999)) (<= (+ (* 4294967296 (div (+ .cse0 (* main_~index2~0 (- 1)) main_~index1~0 4294967295) 4294967296)) 1) main_~index1~0)))) [2020-11-07 06:38:53,965 INFO L262 CegarLoopResult]: At program point L49-2(line 49) the Hoare annotation is: (let ((.cse10 (div main_~index1~0 4294967296))) (let ((.cse5 (select |#memory_int| |main_~#array~0.base|)) (.cse7 (* 4294967296 .cse10)) (.cse9 (div (+ |main_#t~post8| 4294867296) 4294967296)) (.cse6 (div main_~index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse6)) (.cse1 (* 4294967296 .cse9)) (.cse2 (+ |main_#t~post8| .cse7)) (.cse4 (select .cse5 (+ (* .cse10 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (and (<= main_~index2~0 (+ .cse0 99998)) (<= (+ .cse1 main_~index1~0) .cse2) (or (<= (let ((.cse3 (select .cse5 (+ (* .cse6 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse3 (* 4294967296 (div (+ .cse4 (* .cse3 (- 1)) 4294967295) 4294967296)))) .cse4) (<= (+ .cse0 main_~index1~0) (+ .cse7 main_~index2~0))) (or (<= (+ .cse1 main_~index1~0 1) .cse2) (<= .cse4 (let ((.cse8 (select .cse5 (+ (* |main_#t~post8| 4) (* .cse9 (- 17179869184)) |main_~#array~0.offset| (- 4))))) (+ .cse8 (* 4294967296 (div (+ .cse4 (* .cse8 (- 1))) 4294967296)))))) (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)))))) [2020-11-07 06:38:53,965 INFO L262 CegarLoopResult]: At program point L45-1(lines 43 51) the Hoare annotation is: (let ((.cse4 (div main_~index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse4))) (or (and (<= main_~index2~0 (+ .cse0 99998)) (let ((.cse5 (div main_~index1~0 4294967296))) (or (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse2 (select .cse3 (+ (* .cse5 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse1 (select .cse3 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ .cse2 (* .cse1 (- 1)) 4294967295) 4294967296)))) .cse2))) (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 .cse5) main_~index2~0)))) (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294))) (and (<= main_~index2~0 (+ .cse0 99999)) (= main_~loop_entered~0 0))))) [2020-11-07 06:38:53,966 INFO L262 CegarLoopResult]: At program point L45-2(lines 34 61) the Hoare annotation is: (or (let ((.cse0 (div main_~index2~0 4294967296)) (.cse1 (div main_~index1~0 4294967296))) (and (<= main_~index2~0 (+ (* 4294967296 .cse0) 99998)) (<= main_~index1~0 (+ (* 4294967296 .cse1) 100000)) (let ((.cse4 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse3 (select .cse4 (+ (* .cse1 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse2 (select .cse4 (+ (* .cse0 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse2 (* 4294967296 (div (+ .cse3 (* .cse2 (- 1)) 4294967295) 4294967296)))) .cse3))) (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)))) (= main_~loop_entered~0 0)) [2020-11-07 06:38:53,966 INFO L262 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (= main_~loop_entered~0 0) [2020-11-07 06:38:53,966 INFO L262 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (= main_~loop_entered~0 0) [2020-11-07 06:38:53,966 INFO L269 CegarLoopResult]: At program point L37(line 37) the Hoare annotation is: true [2020-11-07 06:38:53,967 INFO L262 CegarLoopResult]: At program point L54-2(lines 54 58) the Hoare annotation is: (let ((.cse5 (div main_~index1~0 4294967296))) (let ((.cse4 (div main_~index2~0 4294967296)) (.cse0 (* 4294967296 .cse5))) (or (and (<= main_~index1~0 (+ .cse0 100000)) (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse2 (select .cse3 (+ (* .cse5 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse1 (select .cse3 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ .cse2 (* .cse1 (- 1)) 4294967295) 4294967296)))) .cse2))) (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294))) (<= (+ (* 4294967296 .cse4) main_~index1~0 1) (+ .cse0 main_~index2~0))))) [2020-11-07 06:38:53,967 INFO L262 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: (let ((.cse4 (div main_~index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse4))) (and (<= main_~index2~0 (+ .cse0 99998)) (let ((.cse5 (div main_~index1~0 4294967296))) (or (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse2 (select .cse3 (+ (* .cse5 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse1 (select .cse3 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ .cse2 (* .cse1 (- 1)) 4294967295) 4294967296)))) .cse2))) (<= (+ .cse0 main_~index1~0) (+ (* 4294967296 .cse5) main_~index2~0)))) (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294))))) [2020-11-07 06:38:53,967 INFO L262 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse0 99999)) (or (<= main_~index2~0 (+ .cse0 99998)) (= main_~loop_entered~0 0)) (<= (+ .cse0 main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0)))) [2020-11-07 06:38:53,967 INFO L262 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse0 99999)) (<= (+ .cse0 main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0)))) [2020-11-07 06:38:53,967 INFO L269 CegarLoopResult]: At program point mainFINAL(lines 33 61) the Hoare annotation is: true [2020-11-07 06:38:53,968 INFO L262 CegarLoopResult]: At program point L42(line 42) the Hoare annotation is: (= main_~loop_entered~0 0) [2020-11-07 06:38:53,968 INFO L269 CegarLoopResult]: At program point L38(line 38) the Hoare annotation is: true [2020-11-07 06:38:53,968 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 33 61) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2020-11-07 06:38:53,968 INFO L262 CegarLoopResult]: At program point L55(line 55) the Hoare annotation is: (let ((.cse3 (div main_~index2~0 4294967296))) (and (let ((.cse2 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse1 (select .cse2 (+ (* (div main_~index1~0 4294967296) (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse0 (select .cse2 (+ (* .cse3 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse0 (* 4294967296 (div (+ .cse1 (* .cse0 (- 1)) 4294967295) 4294967296)))) .cse1))) (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)) (<= main_~index2~0 (+ (* 4294967296 .cse3) 99999)))) [2020-11-07 06:38:53,969 INFO L262 CegarLoopResult]: At program point L55-1(line 55) the Hoare annotation is: (and (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)) (let ((.cse6 (div main_~index2~0 4294967296))) (let ((.cse0 (+ (* 4294967296 .cse6) 2147483647)) (.cse2 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (* .cse6 (- 17179869184))) (.cse4 (* main_~index2~0 4))) (or (and (<= main_~index2~0 .cse0) (<= |main_#t~mem9| (let ((.cse1 (select .cse2 (+ .cse3 .cse4 |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) |main_#t~mem9|) 4294967296)))))) (and (< .cse0 main_~index2~0) (<= |main_#t~mem9| (let ((.cse5 (select .cse2 (+ .cse3 .cse4 |main_~#array~0.offset| (- 17179869184))))) (+ .cse5 (* 4294967296 (div (+ |main_#t~mem9| (* .cse5 (- 1))) 4294967296)))))))))) [2020-11-07 06:38:53,969 INFO L262 CegarLoopResult]: At program point L55-2(line 55) the Hoare annotation is: (let ((.cse8 (* 4294967296 (div |main_#t~mem10| 4294967296))) (.cse7 (+ (* 4294967296 (div |main_#t~mem9| 4294967296)) |main_#t~mem10|))) (and (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)) (let ((.cse6 (div main_~index2~0 4294967296))) (let ((.cse0 (+ (* 4294967296 .cse6) 2147483647)) (.cse2 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (* .cse6 (- 17179869184))) (.cse4 (* main_~index2~0 4))) (or (and (<= main_~index2~0 .cse0) (<= |main_#t~mem9| (let ((.cse1 (select .cse2 (+ .cse3 .cse4 |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ (* .cse1 (- 1)) |main_#t~mem9|) 4294967296)))))) (and (< .cse0 main_~index2~0) (<= |main_#t~mem9| (let ((.cse5 (select .cse2 (+ .cse3 .cse4 |main_~#array~0.offset| (- 17179869184))))) (+ .cse5 (* 4294967296 (div (+ |main_#t~mem9| (* .cse5 (- 1))) 4294967296))))))))) (< .cse7 (+ |main_#t~mem9| .cse8 1)) (<= (+ |main_#t~mem9| .cse8) .cse7))) [2020-11-07 06:38:53,969 INFO L262 CegarLoopResult]: At program point L55-3(line 55) the Hoare annotation is: (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)) [2020-11-07 06:38:53,970 INFO L262 CegarLoopResult]: At program point L55-4(line 55) the Hoare annotation is: (<= main_~index2~0 (+ (* 4294967296 (div (+ (* (div (+ main_~index1~0 (- 1)) 4294967296) 4294967296) main_~index2~0 (* main_~index1~0 (- 1)) 1) 4294967296)) 4294967294)) [2020-11-07 06:38:53,970 INFO L262 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div main_~index2~0 4294967296))) (.cse0 (div main_~index1~0 4294967296))) (and (= (select (select |#memory_int| |main_~#array~0.base|) (+ (* .cse0 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)) |main_#t~mem5|) (<= main_~index2~0 (+ .cse1 99999)) (<= (+ .cse1 main_~index1~0 1) (+ (* 4294967296 .cse0) main_~index2~0)))) [2020-11-07 06:38:53,970 INFO L262 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse2 (div main_~index2~0 4294967296))) (let ((.cse0 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (* 4294967296 .cse2)) (.cse1 (div main_~index1~0 4294967296))) (and (= (select .cse0 (+ (* .cse1 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)) |main_#t~mem5|) (= (select .cse0 (+ (* .cse2 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)) |main_#t~mem6|) (<= main_~index2~0 (+ .cse3 99999)) (<= (+ .cse3 main_~index1~0 1) (+ (* 4294967296 .cse1) main_~index2~0))))) [2020-11-07 06:38:53,970 INFO L262 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse4 (div main_~index2~0 4294967296)) (.cse5 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (div main_~index1~0 4294967296))) (let ((.cse0 (select .cse5 (+ (* .cse3 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|))) (.cse1 (select .cse5 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|))) (.cse2 (* 4294967296 .cse4))) (and (= .cse0 |main_#t~mem5|) (= .cse1 |main_#t~mem6|) (<= (+ .cse0 (* 4294967296 (div (+ (* .cse0 (- 1)) .cse1 4294967295) 4294967296))) .cse1) (<= main_~index2~0 (+ .cse2 99999)) (<= (+ .cse2 main_~index1~0 1) (+ (* 4294967296 .cse3) main_~index2~0))))) [2020-11-07 06:38:53,971 INFO L262 CegarLoopResult]: At program point L47-3(line 47) the Hoare annotation is: (let ((.cse3 (div main_~index2~0 4294967296)) (.cse2 (select |#memory_int| |main_~#array~0.base|)) (.cse5 (div main_~index1~0 4294967296))) (let ((.cse0 (select .cse2 (+ (* .cse5 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|))) (.cse4 (* 4294967296 .cse3))) (and (= .cse0 |main_#t~mem5|) (let ((.cse1 (select .cse2 (+ (* .cse3 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (<= (+ .cse0 (* 4294967296 (div (+ (* .cse0 (- 1)) .cse1 4294967295) 4294967296))) .cse1)) (<= main_~index2~0 (+ .cse4 99999)) (<= (+ .cse4 main_~index1~0 1) (+ (* 4294967296 .cse5) main_~index2~0))))) [2020-11-07 06:38:53,971 INFO L262 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (= main_~loop_entered~0 0) [2020-11-07 06:38:53,971 INFO L269 CegarLoopResult]: At program point L35(line 35) the Hoare annotation is: true [2020-11-07 06:38:53,971 INFO L269 CegarLoopResult]: At program point L35-1(line 35) the Hoare annotation is: true [2020-11-07 06:38:53,976 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 23 29) the Hoare annotation is: true [2020-11-07 06:38:53,976 INFO L262 CegarLoopResult]: At program point L26(line 26) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:38:53,976 INFO L262 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 23 29) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:38:53,976 INFO L262 CegarLoopResult]: At program point L25(lines 25 27) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:38:53,977 INFO L262 CegarLoopResult]: At program point L26-1(line 26) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-11-07 06:38:53,977 INFO L262 CegarLoopResult]: At program point L25-2(lines 23 29) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-11-07 06:38:53,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:53,990 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:53,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:53,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:53,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:53,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:53,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:53,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,003 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,004 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,004 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 06:38:54 BoogieIcfgContainer [2020-11-07 06:38:54,017 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 06:38:54,019 INFO L168 Benchmark]: Toolchain (without parser) took 154985.73 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 127.1 MB in the beginning and 162.3 MB in the end (delta: -35.2 MB). Peak memory consumption was 121.0 MB. Max. memory is 8.0 GB. [2020-11-07 06:38:54,020 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 151.0 MB. Free memory is still 125.3 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 06:38:54,021 INFO L168 Benchmark]: CACSL2BoogieTranslator took 422.61 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 116.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-11-07 06:38:54,021 INFO L168 Benchmark]: Boogie Preprocessor took 87.82 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 115.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2020-11-07 06:38:54,022 INFO L168 Benchmark]: RCFGBuilder took 673.09 ms. Allocated memory is still 151.0 MB. Free memory was 115.1 MB in the beginning and 128.7 MB in the end (delta: -13.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. [2020-11-07 06:38:54,024 INFO L168 Benchmark]: TraceAbstraction took 153775.27 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 128.2 MB in the beginning and 162.3 MB in the end (delta: -34.1 MB). Peak memory consumption was 120.6 MB. Max. memory is 8.0 GB. [2020-11-07 06:38:54,028 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.25 ms. Allocated memory is still 151.0 MB. Free memory is still 125.3 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 422.61 ms. Allocated memory is still 151.0 MB. Free memory was 126.5 MB in the beginning and 116.7 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 87.82 ms. Allocated memory is still 151.0 MB. Free memory was 116.7 MB in the beginning and 115.1 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 673.09 ms. Allocated memory is still 151.0 MB. Free memory was 115.1 MB in the beginning and 128.7 MB in the end (delta: -13.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 153775.27 ms. Allocated memory was 151.0 MB in the beginning and 218.1 MB in the end (delta: 67.1 MB). Free memory was 128.2 MB in the beginning and 162.3 MB in the end (delta: -34.1 MB). Peak memory consumption was 120.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 18]: 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: 43]: Loop Invariant [2020-11-07 06:38:54,036 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,037 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,037 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,037 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,038 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,039 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,039 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,039 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((index2 <= 4294967296 * (index2 / 4294967296) + 99998 && (unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] + 4294967296 * ((unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] + unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] || 4294967296 * (index2 / 4294967296) + index1 <= 4294967296 * (index1 / 4294967296) + index2)) && index2 <= 4294967296 * (((index1 + -1) / 4294967296 * 4294967296 + index2 + index1 * -1 + 1) / 4294967296) + 4294967294) || (index2 <= 4294967296 * (index2 / 4294967296) + 99999 && loop_entered == 0) - InvariantResult [Line: 54]: Loop Invariant [2020-11-07 06:38:54,040 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,040 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,041 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-07 06:38:54,042 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((index1 <= 4294967296 * (index1 / 4294967296) + 100000 && unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] + 4294967296 * ((unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] + unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array]) && index2 <= 4294967296 * (((index1 + -1) / 4294967296 * 4294967296 + index2 + index1 * -1 + 1) / 4294967296) + 4294967294) || 4294967296 * (index2 / 4294967296) + index1 + 1 <= 4294967296 * (index1 / 4294967296) + index2 - ProcedureContractResult [Line: 18]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: cond == \old(cond) && !(\old(cond) == 0) - ProcedureContractResult [Line: 33]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 23]: 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, 71 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 92.7s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 78.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 60.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 319 SDtfs, 261 SDslu, 1623 SDs, 0 SdLazy, 1800 SolverSat, 114 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 25.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 65 SyntacticMatches, 11 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 829 ImplicationChecksByTransitivity, 63.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 66 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 168 PreInvPairs, 246 NumberOfFragments, 2664 HoareAnnotationTreeSize, 168 FomulaSimplifications, 3000 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 71 FomulaSimplificationsInter, 2684 FormulaSimplificationTreeSizeReductionInter, 60.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.7s InterpolantComputationTime, 358 NumberOfCodeBlocks, 358 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 352 ConstructedInterpolants, 0 QuantifiedInterpolants, 488339 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 97/112 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...