/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/recursive-simple/id2_i5_o5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-b8ad66e [2020-10-24 00:54:34,186 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-24 00:54:34,189 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-24 00:54:34,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-24 00:54:34,232 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-24 00:54:34,234 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-24 00:54:34,235 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-24 00:54:34,238 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-24 00:54:34,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-24 00:54:34,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-24 00:54:34,265 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-24 00:54:34,283 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-24 00:54:34,283 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-24 00:54:34,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-24 00:54:34,292 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-24 00:54:34,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-24 00:54:34,299 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-24 00:54:34,300 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-24 00:54:34,307 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-24 00:54:34,315 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-24 00:54:34,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-24 00:54:34,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-24 00:54:34,322 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-24 00:54:34,325 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-24 00:54:34,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-24 00:54:34,331 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-24 00:54:34,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-24 00:54:34,332 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-24 00:54:34,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-24 00:54:34,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-24 00:54:34,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-24 00:54:34,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-24 00:54:34,342 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-24 00:54:34,345 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-24 00:54:34,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-24 00:54:34,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-24 00:54:34,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-24 00:54:34,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-24 00:54:34,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-24 00:54:34,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-24 00:54:34,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-24 00:54:34,350 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-10-24 00:54:34,374 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-24 00:54:34,375 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-24 00:54:34,380 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-24 00:54:34,381 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-24 00:54:34,381 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-24 00:54:34,381 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-24 00:54:34,381 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-24 00:54:34,381 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-24 00:54:34,382 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-24 00:54:34,382 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-24 00:54:34,383 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-24 00:54:34,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-24 00:54:34,383 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-24 00:54:34,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-24 00:54:34,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-24 00:54:34,384 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-10-24 00:54:34,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-24 00:54:34,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-24 00:54:34,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-24 00:54:34,385 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-24 00:54:34,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-10-24 00:54:34,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-24 00:54:34,385 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-10-24 00:54:34,882 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-24 00:54:34,913 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-24 00:54:34,917 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-24 00:54:34,918 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-24 00:54:34,919 INFO L275 PluginConnector]: CDTParser initialized [2020-10-24 00:54:34,920 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-10-24 00:54:35,015 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834c7a99b/ea1b8cd5ac464e9596772b0ca1371dfc/FLAGd760d7093 [2020-10-24 00:54:35,641 INFO L306 CDTParser]: Found 1 translation units. [2020-10-24 00:54:35,642 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_i5_o5-2.c [2020-10-24 00:54:35,651 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834c7a99b/ea1b8cd5ac464e9596772b0ca1371dfc/FLAGd760d7093 [2020-10-24 00:54:35,984 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/834c7a99b/ea1b8cd5ac464e9596772b0ca1371dfc [2020-10-24 00:54:35,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-24 00:54:35,997 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-10-24 00:54:35,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-24 00:54:35,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-24 00:54:36,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-24 00:54:36,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:35" (1/1) ... [2020-10-24 00:54:36,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2be694d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36, skipping insertion in model container [2020-10-24 00:54:36,009 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 12:54:35" (1/1) ... [2020-10-24 00:54:36,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-24 00:54:36,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-24 00:54:36,199 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:54:36,211 INFO L203 MainTranslator]: Completed pre-run [2020-10-24 00:54:36,226 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-24 00:54:36,242 INFO L208 MainTranslator]: Completed translation [2020-10-24 00:54:36,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36 WrapperNode [2020-10-24 00:54:36,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-24 00:54:36,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-24 00:54:36,244 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-24 00:54:36,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-24 00:54:36,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (1/1) ... [2020-10-24 00:54:36,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (1/1) ... [2020-10-24 00:54:36,267 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (1/1) ... [2020-10-24 00:54:36,267 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (1/1) ... [2020-10-24 00:54:36,273 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (1/1) ... [2020-10-24 00:54:36,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (1/1) ... [2020-10-24 00:54:36,276 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (1/1) ... [2020-10-24 00:54:36,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-24 00:54:36,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-24 00:54:36,282 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-24 00:54:36,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-24 00:54:36,283 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (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-10-24 00:54:36,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-24 00:54:36,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-24 00:54:36,407 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-24 00:54:36,407 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-10-24 00:54:36,407 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-10-24 00:54:36,408 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-24 00:54:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-10-24 00:54:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-24 00:54:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-24 00:54:36,408 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-24 00:54:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-24 00:54:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-10-24 00:54:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-10-24 00:54:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-24 00:54:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-24 00:54:36,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-24 00:54:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-24 00:54:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-24 00:54:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-24 00:54:36,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-24 00:54:36,900 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-24 00:54:36,901 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-24 00:54:36,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:36 BoogieIcfgContainer [2020-10-24 00:54:36,906 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-24 00:54:36,910 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-24 00:54:36,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-24 00:54:36,915 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-24 00:54:36,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 12:54:35" (1/3) ... [2020-10-24 00:54:36,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af53dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:36, skipping insertion in model container [2020-10-24 00:54:36,917 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 12:54:36" (2/3) ... [2020-10-24 00:54:36,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2af53dd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 12:54:36, skipping insertion in model container [2020-10-24 00:54:36,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 12:54:36" (3/3) ... [2020-10-24 00:54:36,920 INFO L111 eAbstractionObserver]: Analyzing ICFG id2_i5_o5-2.c [2020-10-24 00:54:36,934 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-24 00:54:36,940 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-24 00:54:36,960 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-24 00:54:37,001 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-24 00:54:37,001 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-24 00:54:37,002 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-24 00:54:37,002 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-24 00:54:37,002 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-24 00:54:37,002 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-24 00:54:37,002 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-24 00:54:37,002 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-24 00:54:37,026 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-10-24 00:54:37,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-24 00:54:37,041 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:37,043 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:37,043 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:37,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:37,058 INFO L82 PathProgramCache]: Analyzing trace with hash -407315157, now seen corresponding path program 1 times [2020-10-24 00:54:37,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:37,070 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [928841191] [2020-10-24 00:54:37,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:37,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:37,458 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:37,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:54:37,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [928841191] [2020-10-24 00:54:37,522 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:37,522 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-24 00:54:37,523 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436577299] [2020-10-24 00:54:37,528 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-24 00:54:37,529 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:37,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-24 00:54:37,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-24 00:54:37,547 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2020-10-24 00:54:37,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:37,902 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2020-10-24 00:54:37,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-24 00:54:37,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-24 00:54:37,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:37,915 INFO L225 Difference]: With dead ends: 59 [2020-10-24 00:54:37,916 INFO L226 Difference]: Without dead ends: 41 [2020-10-24 00:54:37,919 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-24 00:54:37,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-24 00:54:37,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-24 00:54:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2020-10-24 00:54:37,980 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 25 [2020-10-24 00:54:37,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:37,981 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2020-10-24 00:54:37,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-24 00:54:37,981 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2020-10-24 00:54:37,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-10-24 00:54:37,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:37,984 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:37,984 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-24 00:54:37,985 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:37,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:37,986 INFO L82 PathProgramCache]: Analyzing trace with hash -795183819, now seen corresponding path program 1 times [2020-10-24 00:54:37,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:37,986 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [541466719] [2020-10-24 00:54:37,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:38,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:38,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,091 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:38,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-24 00:54:38,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [541466719] [2020-10-24 00:54:38,163 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-24 00:54:38,163 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-24 00:54:38,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151106473] [2020-10-24 00:54:38,165 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-24 00:54:38,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:38,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-24 00:54:38,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-10-24 00:54:38,167 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 8 states. [2020-10-24 00:54:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:38,539 INFO L93 Difference]: Finished difference Result 55 states and 57 transitions. [2020-10-24 00:54:38,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-24 00:54:38,540 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-10-24 00:54:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:38,542 INFO L225 Difference]: With dead ends: 55 [2020-10-24 00:54:38,542 INFO L226 Difference]: Without dead ends: 48 [2020-10-24 00:54:38,544 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:54:38,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-24 00:54:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2020-10-24 00:54:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-10-24 00:54:38,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2020-10-24 00:54:38,563 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 33 [2020-10-24 00:54:38,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:38,563 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2020-10-24 00:54:38,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-24 00:54:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2020-10-24 00:54:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-10-24 00:54:38,566 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:38,566 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:38,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-24 00:54:38,567 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:38,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:38,568 INFO L82 PathProgramCache]: Analyzing trace with hash 870121323, now seen corresponding path program 1 times [2020-10-24 00:54:38,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:38,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958795743] [2020-10-24 00:54:38,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,701 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,764 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-10-24 00:54:38,790 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1958795743] [2020-10-24 00:54:38,790 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:38,790 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-10-24 00:54:38,791 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452922818] [2020-10-24 00:54:38,791 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-24 00:54:38,792 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:38,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-24 00:54:38,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-10-24 00:54:38,793 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 9 states. [2020-10-24 00:54:39,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:39,196 INFO L93 Difference]: Finished difference Result 65 states and 67 transitions. [2020-10-24 00:54:39,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-24 00:54:39,196 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2020-10-24 00:54:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:39,198 INFO L225 Difference]: With dead ends: 65 [2020-10-24 00:54:39,199 INFO L226 Difference]: Without dead ends: 58 [2020-10-24 00:54:39,200 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2020-10-24 00:54:39,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-24 00:54:39,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2020-10-24 00:54:39,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-10-24 00:54:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-10-24 00:54:39,216 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 41 [2020-10-24 00:54:39,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:39,217 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-10-24 00:54:39,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-24 00:54:39,217 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-10-24 00:54:39,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-10-24 00:54:39,219 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:39,219 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-10-24 00:54:39,219 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-24 00:54:39,220 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:39,220 INFO L82 PathProgramCache]: Analyzing trace with hash -308032267, now seen corresponding path program 1 times [2020-10-24 00:54:39,221 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:39,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [317461627] [2020-10-24 00:54:39,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:39,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:39,298 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:39,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:39,342 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:39,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:39,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:39,400 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-24 00:54:39,427 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [317461627] [2020-10-24 00:54:39,427 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:39,427 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-10-24 00:54:39,428 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589111348] [2020-10-24 00:54:39,428 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-24 00:54:39,428 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:39,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-24 00:54:39,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2020-10-24 00:54:39,430 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 10 states. [2020-10-24 00:54:39,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:39,940 INFO L93 Difference]: Finished difference Result 75 states and 77 transitions. [2020-10-24 00:54:39,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-24 00:54:39,941 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2020-10-24 00:54:39,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:39,943 INFO L225 Difference]: With dead ends: 75 [2020-10-24 00:54:39,943 INFO L226 Difference]: Without dead ends: 68 [2020-10-24 00:54:39,944 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2020-10-24 00:54:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-10-24 00:54:39,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 56. [2020-10-24 00:54:39,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-10-24 00:54:39,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2020-10-24 00:54:39,961 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 49 [2020-10-24 00:54:39,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:39,962 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2020-10-24 00:54:39,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-24 00:54:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2020-10-24 00:54:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-10-24 00:54:39,964 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:39,964 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-10-24 00:54:39,964 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-24 00:54:39,965 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1623603797, now seen corresponding path program 2 times [2020-10-24 00:54:39,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:39,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [535479556] [2020-10-24 00:54:39,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:40,041 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:40,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:40,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:40,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:40,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:40,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:40,227 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:40,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:40,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-10-24 00:54:40,255 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [535479556] [2020-10-24 00:54:40,255 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:40,255 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-10-24 00:54:40,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143415223] [2020-10-24 00:54:40,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-24 00:54:40,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:40,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-24 00:54:40,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-10-24 00:54:40,258 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand 11 states. [2020-10-24 00:54:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:40,906 INFO L93 Difference]: Finished difference Result 85 states and 87 transitions. [2020-10-24 00:54:40,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-24 00:54:40,907 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 57 [2020-10-24 00:54:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:40,908 INFO L225 Difference]: With dead ends: 85 [2020-10-24 00:54:40,909 INFO L226 Difference]: Without dead ends: 78 [2020-10-24 00:54:40,910 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=73, Invalid=269, Unknown=0, NotChecked=0, Total=342 [2020-10-24 00:54:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-10-24 00:54:40,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 61. [2020-10-24 00:54:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-24 00:54:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2020-10-24 00:54:40,928 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 57 [2020-10-24 00:54:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:40,929 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2020-10-24 00:54:40,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-24 00:54:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2020-10-24 00:54:40,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-10-24 00:54:40,931 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:40,931 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2020-10-24 00:54:40,931 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-24 00:54:40,932 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:40,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:40,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1353914187, now seen corresponding path program 2 times [2020-10-24 00:54:40,932 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:40,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2039944466] [2020-10-24 00:54:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:41,064 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:41,072 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:41,143 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:41,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:41,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:41,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:41,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:41,323 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:41,369 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:41,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:41,415 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-24 00:54:41,415 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2039944466] [2020-10-24 00:54:41,415 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:41,416 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-10-24 00:54:41,416 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762967729] [2020-10-24 00:54:41,417 INFO L461 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-10-24 00:54:41,417 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:41,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-10-24 00:54:41,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2020-10-24 00:54:41,418 INFO L87 Difference]: Start difference. First operand 61 states and 63 transitions. Second operand 16 states. [2020-10-24 00:54:43,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:43,124 INFO L93 Difference]: Finished difference Result 95 states and 97 transitions. [2020-10-24 00:54:43,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-10-24 00:54:43,125 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 65 [2020-10-24 00:54:43,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:43,127 INFO L225 Difference]: With dead ends: 95 [2020-10-24 00:54:43,127 INFO L226 Difference]: Without dead ends: 88 [2020-10-24 00:54:43,134 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=123, Invalid=1067, Unknown=0, NotChecked=0, Total=1190 [2020-10-24 00:54:43,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2020-10-24 00:54:43,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 66. [2020-10-24 00:54:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2020-10-24 00:54:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2020-10-24 00:54:43,172 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 65 [2020-10-24 00:54:43,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:43,172 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2020-10-24 00:54:43,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-10-24 00:54:43,172 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2020-10-24 00:54:43,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-10-24 00:54:43,180 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:43,180 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:43,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-24 00:54:43,181 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:43,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:43,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1561710613, now seen corresponding path program 3 times [2020-10-24 00:54:43,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:43,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1531926225] [2020-10-24 00:54:43,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,281 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:43,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,345 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,371 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:43,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,395 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,417 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,437 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:43,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:43,494 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2020-10-24 00:54:43,495 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1531926225] [2020-10-24 00:54:43,495 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:43,495 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-10-24 00:54:43,495 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805433835] [2020-10-24 00:54:43,497 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-10-24 00:54:43,497 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:43,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-24 00:54:43,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2020-10-24 00:54:43,499 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 13 states. [2020-10-24 00:54:44,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:44,337 INFO L93 Difference]: Finished difference Result 105 states and 107 transitions. [2020-10-24 00:54:44,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-24 00:54:44,338 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 73 [2020-10-24 00:54:44,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:44,339 INFO L225 Difference]: With dead ends: 105 [2020-10-24 00:54:44,339 INFO L226 Difference]: Without dead ends: 65 [2020-10-24 00:54:44,346 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2020-10-24 00:54:44,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-10-24 00:54:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2020-10-24 00:54:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2020-10-24 00:54:44,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 66 transitions. [2020-10-24 00:54:44,386 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 66 transitions. Word has length 73 [2020-10-24 00:54:44,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:44,386 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 66 transitions. [2020-10-24 00:54:44,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-10-24 00:54:44,387 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2020-10-24 00:54:44,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2020-10-24 00:54:44,391 INFO L414 BasicCegarLoop]: Found error trace [2020-10-24 00:54:44,391 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-24 00:54:44,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-24 00:54:44,392 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-24 00:54:44,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-24 00:54:44,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1203189643, now seen corresponding path program 3 times [2020-10-24 00:54:44,393 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-10-24 00:54:44,393 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1642018011] [2020-10-24 00:54:44,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-24 00:54:44,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,494 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-24 00:54:44,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,499 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2020-10-24 00:54:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,532 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,566 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:44,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,606 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:44,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,643 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:44,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,666 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:44,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,685 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:44,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,711 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-24 00:54:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-24 00:54:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 45 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2020-10-24 00:54:44,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1642018011] [2020-10-24 00:54:44,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-10-24 00:54:44,762 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2020-10-24 00:54:44,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130065830] [2020-10-24 00:54:44,764 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-10-24 00:54:44,764 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-10-24 00:54:44,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-24 00:54:44,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2020-10-24 00:54:44,765 INFO L87 Difference]: Start difference. First operand 65 states and 66 transitions. Second operand 14 states. [2020-10-24 00:54:45,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-24 00:54:45,524 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2020-10-24 00:54:45,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-10-24 00:54:45,526 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 81 [2020-10-24 00:54:45,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-24 00:54:45,527 INFO L225 Difference]: With dead ends: 65 [2020-10-24 00:54:45,527 INFO L226 Difference]: Without dead ends: 0 [2020-10-24 00:54:45,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2020-10-24 00:54:45,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-10-24 00:54:45,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-10-24 00:54:45,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-10-24 00:54:45,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-10-24 00:54:45,534 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 81 [2020-10-24 00:54:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-24 00:54:45,534 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-24 00:54:45,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-10-24 00:54:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-10-24 00:54:45,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-10-24 00:54:45,537 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-24 00:54:45,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-10-24 00:54:45,677 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2020-10-24 00:54:46,006 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 65 [2020-10-24 00:54:46,288 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2020-10-24 00:54:46,414 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2020-10-24 00:54:46,602 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 87 [2020-10-24 00:54:46,716 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 64 [2020-10-24 00:54:47,132 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2020-10-24 00:54:47,466 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2020-10-24 00:54:47,726 WARN L193 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2020-10-24 00:54:48,111 WARN L193 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 40 [2020-10-24 00:54:48,478 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2020-10-24 00:54:48,683 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 31 [2020-10-24 00:54:49,105 WARN L193 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 36 [2020-10-24 00:54:49,324 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2020-10-24 00:54:49,531 WARN L193 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 25 [2020-10-24 00:54:49,737 WARN L193 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 32 [2020-10-24 00:54:49,946 INFO L277 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,946 INFO L277 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,946 INFO L277 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,947 INFO L277 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,947 INFO L277 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,947 INFO L277 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,947 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:49,947 INFO L277 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:49,947 INFO L277 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,947 INFO L270 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string5.offset| |old(#t~string5.offset)|) (= |old(#length)| |#length|) (= |#t~string6.base| |old(#t~string6.base)|) (= |#t~string6.offset| |old(#t~string6.offset)|) (= |#t~string4.base| |old(#t~string4.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string4.offset| |old(#t~string4.offset)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-10-24 00:54:49,948 INFO L277 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,948 INFO L277 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,948 INFO L277 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-10-24 00:54:49,948 INFO L277 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:54:49,948 INFO L270 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-10-24 00:54:49,948 INFO L270 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (= id2_~x |id2_#in~x|) [2020-10-24 00:54:49,949 INFO L270 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (or (and (<= |id2_#in~x| 1) .cse0) (and (<= |id2_#t~ret8| 1) .cse1 (<= 1 |id2_#t~ret8|) .cse0)) (<= 1 |id2_#in~x|)) (and (or .cse1 (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3))) (<= 3 |id2_#in~x|) .cse0) (and (<= 5 |id2_#in~x|) .cse0))) [2020-10-24 00:54:49,949 INFO L270 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (and (= |id2_#in~x| 0) (= id2_~x |id2_#in~x|)) [2020-10-24 00:54:49,949 INFO L270 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (or (and (<= |id2_#in~x| 1) .cse0) (and (<= |id2_#t~ret8| 1) .cse1 (<= 1 |id2_#t~ret8|) .cse0)) (<= 1 |id2_#in~x|)) (and (or .cse1 (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3))) (<= 3 |id2_#in~x|) .cse0) (and (<= 5 |id2_#in~x|) .cse0))) [2020-10-24 00:54:49,949 INFO L270 CegarLoopResult]: At program point L16-3(line 16) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (<= 5 |id2_#in~x|) .cse0) (and (<= 3 |id2_#in~x|) (or .cse1 (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3) (<= |id2_#res| 4) (<= 4 |id2_#res|))) .cse0) (and (or (and (<= |id2_#in~x| 1) .cse0) (and (<= 2 |id2_#res|) (<= |id2_#t~ret8| 1) .cse1 (<= 1 |id2_#t~ret8|) (<= |id2_#res| 2) .cse0)) (<= 1 |id2_#in~x|)))) [2020-10-24 00:54:49,950 INFO L270 CegarLoopResult]: At program point id2EXIT(lines 14 17) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (<= 3 |id2_#in~x|) (or (and (<= |id2_#res| 4) .cse0 (<= 4 |id2_#res|)) (and .cse1 .cse0))) (and (= |id2_#in~x| 0) (= |id2_#res| 0) .cse0) (and (or (and (<= 2 |id2_#res|) .cse1 (<= |id2_#res| 2)) (<= |id2_#in~x| 1)) (<= 1 |id2_#in~x|) .cse0) (and (<= 5 |id2_#in~x|) .cse0))) [2020-10-24 00:54:49,950 INFO L277 CegarLoopResult]: At program point id2ENTRY(lines 14 17) the Hoare annotation is: true [2020-10-24 00:54:49,950 INFO L270 CegarLoopResult]: At program point id2FINAL(lines 14 17) the Hoare annotation is: (let ((.cse1 (<= |id2_#in~x| 3)) (.cse0 (= id2_~x |id2_#in~x|))) (or (and (<= 3 |id2_#in~x|) (or (and (<= |id2_#res| 4) .cse0 (<= 4 |id2_#res|)) (and .cse1 .cse0))) (and (= |id2_#in~x| 0) (= |id2_#res| 0) .cse0) (and (or (and (<= 2 |id2_#res|) .cse1 (<= |id2_#res| 2)) (<= |id2_#in~x| 1)) (<= 1 |id2_#in~x|) .cse0) (and (<= 5 |id2_#in~x|) .cse0))) [2020-10-24 00:54:49,950 INFO L277 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-10-24 00:54:49,950 INFO L277 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-10-24 00:54:49,950 INFO L277 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-10-24 00:54:49,951 INFO L277 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-10-24 00:54:49,951 INFO L277 CegarLoopResult]: At program point mainENTRY(lines 19 25) the Hoare annotation is: true [2020-10-24 00:54:49,951 INFO L270 CegarLoopResult]: At program point mainEXIT(lines 19 25) the Hoare annotation is: (<= 5 main_~input~0) [2020-10-24 00:54:49,951 INFO L270 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: false [2020-10-24 00:54:49,951 INFO L270 CegarLoopResult]: At program point L22(lines 22 24) the Hoare annotation is: (and (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-10-24 00:54:49,951 INFO L270 CegarLoopResult]: At program point L23-1(line 23) the Hoare annotation is: false [2020-10-24 00:54:49,951 INFO L270 CegarLoopResult]: At program point L21(line 21) the Hoare annotation is: (and (<= main_~input~0 5) (<= 5 main_~input~0)) [2020-10-24 00:54:49,952 INFO L270 CegarLoopResult]: At program point L21-1(line 21) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= |main_#t~ret9| 5) (<= 5 main_~input~0)) [2020-10-24 00:54:49,952 INFO L270 CegarLoopResult]: At program point L22-2(lines 19 25) the Hoare annotation is: (<= 5 main_~input~0) [2020-10-24 00:54:49,952 INFO L270 CegarLoopResult]: At program point L21-2(line 21) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= |main_#t~ret9| 5) (<= 5 main_~input~0)) [2020-10-24 00:54:49,952 INFO L270 CegarLoopResult]: At program point L21-3(line 21) the Hoare annotation is: (and (<= 5 |main_#t~ret9|) (<= |main_#t~ret9| 5) (<= 5 main_~input~0) (<= 5 main_~result~0) (<= main_~result~0 5)) [2020-10-24 00:54:49,952 INFO L270 CegarLoopResult]: At program point idFINAL(lines 9 12) the Hoare annotation is: (let ((.cse1 (<= |id_#in~x| 2)) (.cse2 (= |id_#in~x| id_~x)) (.cse0 (<= |id_#in~x| 4))) (or (and (or (and (<= |id_#res| 3) .cse0 (<= 3 |id_#res|)) .cse1) .cse2 (<= 2 |id_#in~x|)) (and .cse2 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse2 (<= |id_#res| 1) (<= 1 |id_#res|) .cse1) (and .cse2 (= |id_#in~x| 0)) (and (<= 4 |id_#in~x|) (or (and (<= 5 |id_#res|) .cse2 (<= |id_#res| 5)) (and .cse2 .cse0))))) [2020-10-24 00:54:49,953 INFO L270 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-24 00:54:49,953 INFO L270 CegarLoopResult]: At program point idEXIT(lines 9 12) the Hoare annotation is: (let ((.cse1 (<= |id_#in~x| 2)) (.cse2 (= |id_#in~x| id_~x)) (.cse0 (<= |id_#in~x| 4))) (or (and (or (and (<= |id_#res| 3) .cse0 (<= 3 |id_#res|)) .cse1) .cse2 (<= 2 |id_#in~x|)) (and .cse2 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse2 (<= |id_#res| 1) (<= 1 |id_#res|) .cse1) (and .cse2 (= |id_#in~x| 0)) (and (<= 4 |id_#in~x|) (or (and (<= 5 |id_#res|) .cse2 (<= |id_#res| 5)) (and .cse2 .cse0))))) [2020-10-24 00:54:49,953 INFO L270 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: (= |id_#in~x| id_~x) [2020-10-24 00:54:49,953 INFO L270 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x)) (.cse1 (<= |id_#in~x| 4))) (or (and .cse0 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (or (and .cse0 (<= |id_#in~x| 2)) (and .cse0 .cse1 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|))) (<= 2 |id_#in~x|)) (and (or (and .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 .cse1)) (<= 4 |id_#in~x|)))) [2020-10-24 00:54:49,954 INFO L270 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: (and (= |id_#in~x| id_~x) (= |id_#in~x| 0)) [2020-10-24 00:54:49,954 INFO L270 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (let ((.cse0 (= |id_#in~x| id_~x)) (.cse1 (<= |id_#in~x| 4))) (or (and .cse0 (<= 6 |id_#in~x|)) (and (<= 1 |id_#in~x|) .cse0 (= |id_#t~ret7| 0) (<= |id_#in~x| 1)) (and (or (and .cse0 (<= |id_#in~x| 2)) (and .cse0 .cse1 (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|))) (<= 2 |id_#in~x|)) (and (or (and .cse0 (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 .cse1)) (<= 4 |id_#in~x|)))) [2020-10-24 00:54:49,954 INFO L270 CegarLoopResult]: At program point L11-3(line 11) the Hoare annotation is: (and (or (and (or (and (<= |id_#res| 3) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= 3 |id_#res|)) (<= |id_#in~x| 2)) (<= 2 |id_#in~x|)) (and (<= 1 |id_#in~x|) (<= |id_#res| 1) (= |id_#t~ret7| 0) (<= 1 |id_#res|) (<= |id_#in~x| 1)) (<= 4 |id_#in~x|)) (let ((.cse0 (= |id_#in~x| id_~x))) (or (and (<= 5 |id_#res|) .cse0 (<= |id_#res| 5) (<= 4 |id_#t~ret7|) (<= |id_#t~ret7| 4)) (and .cse0 (<= 6 |id_#in~x|)) (and .cse0 (<= |id_#in~x| 4))))) [2020-10-24 00:54:49,955 INFO L277 CegarLoopResult]: At program point idENTRY(lines 9 12) the Hoare annotation is: true [2020-10-24 00:54:49,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 12:54:49 BoogieIcfgContainer [2020-10-24 00:54:49,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-24 00:54:49,979 INFO L168 Benchmark]: Toolchain (without parser) took 13987.50 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 107.1 MB in the beginning and 166.6 MB in the end (delta: -59.5 MB). Peak memory consumption was 127.7 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:49,980 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 151.0 MB. Free memory is still 123.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-10-24 00:54:49,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.59 ms. Allocated memory is still 151.0 MB. Free memory was 106.4 MB in the beginning and 97.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:49,981 INFO L168 Benchmark]: Boogie Preprocessor took 34.44 ms. Allocated memory is still 151.0 MB. Free memory was 97.3 MB in the beginning and 95.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:49,982 INFO L168 Benchmark]: RCFGBuilder took 625.15 ms. Allocated memory is still 151.0 MB. Free memory was 95.9 MB in the beginning and 121.6 MB in the end (delta: -25.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:49,983 INFO L168 Benchmark]: TraceAbstraction took 13066.73 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 121.3 MB in the beginning and 166.6 MB in the end (delta: -45.3 MB). Peak memory consumption was 141.4 MB. Max. memory is 8.0 GB. [2020-10-24 00:54:49,987 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.22 ms. Allocated memory is still 151.0 MB. Free memory is still 123.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 244.59 ms. Allocated memory is still 151.0 MB. Free memory was 106.4 MB in the beginning and 97.3 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 34.44 ms. Allocated memory is still 151.0 MB. Free memory was 97.3 MB in the beginning and 95.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 625.15 ms. Allocated memory is still 151.0 MB. Free memory was 95.9 MB in the beginning and 121.6 MB in the end (delta: -25.7 MB). Peak memory consumption was 5.2 MB. Max. memory is 8.0 GB. * TraceAbstraction took 13066.73 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 121.3 MB in the beginning and 166.6 MB in the end (delta: -45.3 MB). Peak memory consumption was 141.4 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4]: 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 - ProcedureContractResult [Line: 4]: Procedure Contract for reach_error Derived contract for procedure reach_error: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for id2 Derived contract for procedure id2: (((3 <= \old(x) && (((\result <= 4 && x == \old(x)) && 4 <= \result) || (\old(x) <= 3 && x == \old(x)))) || ((\old(x) == 0 && \result == 0) && x == \old(x))) || (((((2 <= \result && \old(x) <= 3) && \result <= 2) || \old(x) <= 1) && 1 <= \old(x)) && x == \old(x))) || (5 <= \old(x) && x == \old(x)) - ProcedureContractResult [Line: 19]: Procedure Contract for main Derived contract for procedure main: 5 <= input - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id: ((((((((\result <= 3 && \old(x) <= 4) && 3 <= \result) || \old(x) <= 2) && \old(x) == x) && 2 <= \old(x)) || (\old(x) == x && 6 <= \old(x))) || ((((1 <= \old(x) && \old(x) == x) && \result <= 1) && 1 <= \result) && \old(x) <= 2)) || (\old(x) == x && \old(x) == 0)) || (4 <= \old(x) && (((5 <= \result && \old(x) == x) && \result <= 5) || (\old(x) == x && \old(x) <= 4))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.5s, OverallIterations: 8, TraceHistogramMax: 4, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 325 SDtfs, 393 SDslu, 876 SDs, 0 SdLazy, 1996 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 223 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 350 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=66occurred in iteration=6, 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, 8 MinimizatonAttempts, 60 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 83 PreInvPairs, 283 NumberOfFragments, 782 HoareAnnotationTreeSize, 83 FomulaSimplifications, 59532 FormulaSimplificationTreeSizeReduction, 1.3s HoareSimplificationTime, 46 FomulaSimplificationsInter, 7171 FormulaSimplificationTreeSizeReductionInter, 3.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 424 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 416 ConstructedInterpolants, 0 QuantifiedInterpolants, 71808 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 165/224 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...