/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_b3_o5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-07 05:06:25,213 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-07 05:06:25,216 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-07 05:06:25,252 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-07 05:06:25,253 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-07 05:06:25,255 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-07 05:06:25,257 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-07 05:06:25,259 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-07 05:06:25,261 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-07 05:06:25,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-07 05:06:25,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-07 05:06:25,295 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-07 05:06:25,295 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-07 05:06:25,297 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-07 05:06:25,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-07 05:06:25,309 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-07 05:06:25,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-07 05:06:25,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-07 05:06:25,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-07 05:06:25,328 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-07 05:06:25,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-07 05:06:25,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-07 05:06:25,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-07 05:06:25,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-07 05:06:25,338 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-07 05:06:25,338 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-07 05:06:25,338 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-07 05:06:25,340 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-07 05:06:25,340 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-07 05:06:25,341 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-07 05:06:25,342 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-07 05:06:25,342 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-07 05:06:25,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-07 05:06:25,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-07 05:06:25,345 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-07 05:06:25,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-07 05:06:25,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-07 05:06:25,347 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-07 05:06:25,347 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-07 05:06:25,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-07 05:06:25,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-07 05:06:25,355 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 05:06:25,377 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-07 05:06:25,378 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-07 05:06:25,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-07 05:06:25,383 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-07 05:06:25,383 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-07 05:06:25,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-07 05:06:25,383 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-07 05:06:25,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-07 05:06:25,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-07 05:06:25,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-07 05:06:25,385 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-07 05:06:25,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-07 05:06:25,386 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-07 05:06:25,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-07 05:06:25,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-07 05:06:25,386 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-11-07 05:06:25,386 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-07 05:06:25,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-07 05:06:25,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-07 05:06:25,387 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-07 05:06:25,387 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-11-07 05:06:25,387 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-07 05:06:25,388 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 05:06:25,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-07 05:06:25,810 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-07 05:06:25,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-07 05:06:25,815 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-07 05:06:25,816 INFO L275 PluginConnector]: CDTParser initialized [2020-11-07 05:06:25,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-11-07 05:06:25,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dee99981/269a3e6337f34b1b976d91856c860a68/FLAG7311605c3 [2020-11-07 05:06:26,624 INFO L306 CDTParser]: Found 1 translation units. [2020-11-07 05:06:26,625 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id2_b3_o5.c [2020-11-07 05:06:26,633 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dee99981/269a3e6337f34b1b976d91856c860a68/FLAG7311605c3 [2020-11-07 05:06:26,997 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7dee99981/269a3e6337f34b1b976d91856c860a68 [2020-11-07 05:06:27,000 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-07 05:06:27,011 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-07 05:06:27,016 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-07 05:06:27,016 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-07 05:06:27,021 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-07 05:06:27,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:26" (1/1) ... [2020-11-07 05:06:27,026 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dbb6873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27, skipping insertion in model container [2020-11-07 05:06:27,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 05:06:26" (1/1) ... [2020-11-07 05:06:27,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-07 05:06:27,055 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-07 05:06:27,260 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:06:27,271 INFO L203 MainTranslator]: Completed pre-run [2020-11-07 05:06:27,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-07 05:06:27,308 INFO L208 MainTranslator]: Completed translation [2020-11-07 05:06:27,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27 WrapperNode [2020-11-07 05:06:27,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-07 05:06:27,311 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-07 05:06:27,311 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-07 05:06:27,311 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-07 05:06:27,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (1/1) ... [2020-11-07 05:06:27,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (1/1) ... [2020-11-07 05:06:27,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (1/1) ... [2020-11-07 05:06:27,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (1/1) ... [2020-11-07 05:06:27,338 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (1/1) ... [2020-11-07 05:06:27,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (1/1) ... [2020-11-07 05:06:27,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (1/1) ... [2020-11-07 05:06:27,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-07 05:06:27,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-07 05:06:27,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-07 05:06:27,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-07 05:06:27,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (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 05:06:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-07 05:06:27,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-07 05:06:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-07 05:06:27,471 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-11-07 05:06:27,472 INFO L138 BoogieDeclarations]: Found implementation of procedure id2 [2020-11-07 05:06:27,472 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-07 05:06:27,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-11-07 05:06:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-07 05:06:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-07 05:06:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-07 05:06:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-07 05:06:27,473 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-11-07 05:06:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure id2 [2020-11-07 05:06:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-07 05:06:27,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-07 05:06:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-07 05:06:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-07 05:06:27,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-07 05:06:27,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-07 05:06:27,477 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-07 05:06:27,756 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-07 05:06:27,756 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-11-07 05:06:27,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:27 BoogieIcfgContainer [2020-11-07 05:06:27,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-07 05:06:27,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-07 05:06:27,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-07 05:06:27,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-07 05:06:27,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 05:06:26" (1/3) ... [2020-11-07 05:06:27,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d945d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:27, skipping insertion in model container [2020-11-07 05:06:27,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 05:06:27" (2/3) ... [2020-11-07 05:06:27,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d945d11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 05:06:27, skipping insertion in model container [2020-11-07 05:06:27,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 05:06:27" (3/3) ... [2020-11-07 05:06:27,781 INFO L111 eAbstractionObserver]: Analyzing ICFG id2_b3_o5.c [2020-11-07 05:06:27,828 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-11-07 05:06:27,838 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-07 05:06:27,875 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-07 05:06:27,908 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-07 05:06:27,908 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-07 05:06:27,909 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-11-07 05:06:27,909 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-07 05:06:27,909 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-07 05:06:27,909 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-07 05:06:27,909 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-07 05:06:27,910 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-07 05:06:27,928 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2020-11-07 05:06:27,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-07 05:06:27,940 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:27,941 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:27,942 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:27,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:27,949 INFO L82 PathProgramCache]: Analyzing trace with hash 138014369, now seen corresponding path program 1 times [2020-11-07 05:06:27,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:27,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1785283494] [2020-11-07 05:06:27,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:28,338 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:28,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:28,397 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:28,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:06:28,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1785283494] [2020-11-07 05:06:28,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:28,451 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:06:28,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763917892] [2020-11-07 05:06:28,457 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:06:28,458 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:28,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:06:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:06:28,478 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 6 states. [2020-11-07 05:06:28,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:28,956 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2020-11-07 05:06:28,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:06:28,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-11-07 05:06:28,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:28,970 INFO L225 Difference]: With dead ends: 64 [2020-11-07 05:06:28,970 INFO L226 Difference]: Without dead ends: 45 [2020-11-07 05:06:28,974 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:06:28,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-11-07 05:06:29,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-11-07 05:06:29,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-07 05:06:29,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-11-07 05:06:29,041 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 25 [2020-11-07 05:06:29,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:29,042 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-11-07 05:06:29,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:06:29,042 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-11-07 05:06:29,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 05:06:29,045 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:29,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:29,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-07 05:06:29,046 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:29,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:29,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1111577060, now seen corresponding path program 1 times [2020-11-07 05:06:29,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:29,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [862551704] [2020-11-07 05:06:29,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:29,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:29,199 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:29,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:29,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:29,288 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:29,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:29,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:06:29,316 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [862551704] [2020-11-07 05:06:29,316 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:29,316 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:06:29,317 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972373102] [2020-11-07 05:06:29,318 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:06:29,319 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:29,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:06:29,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:06:29,320 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2020-11-07 05:06:29,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:29,660 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2020-11-07 05:06:29,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:06:29,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-11-07 05:06:29,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:29,663 INFO L225 Difference]: With dead ends: 73 [2020-11-07 05:06:29,663 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 05:06:29,665 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:06:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 05:06:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2020-11-07 05:06:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-07 05:06:29,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2020-11-07 05:06:29,684 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 34 [2020-11-07 05:06:29,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:29,684 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2020-11-07 05:06:29,684 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:06:29,685 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2020-11-07 05:06:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-07 05:06:29,686 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:29,687 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:29,687 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-07 05:06:29,687 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:29,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:29,688 INFO L82 PathProgramCache]: Analyzing trace with hash 982288804, now seen corresponding path program 1 times [2020-11-07 05:06:29,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:29,688 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1072867199] [2020-11-07 05:06:29,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:29,787 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:29,799 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:29,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:29,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:29,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:29,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-07 05:06:29,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1072867199] [2020-11-07 05:06:29,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:29,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 05:06:29,921 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604538434] [2020-11-07 05:06:29,921 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:06:29,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:29,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:06:29,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:06:29,923 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2020-11-07 05:06:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:30,444 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2020-11-07 05:06:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:06:30,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2020-11-07 05:06:30,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:30,447 INFO L225 Difference]: With dead ends: 59 [2020-11-07 05:06:30,447 INFO L226 Difference]: Without dead ends: 53 [2020-11-07 05:06:30,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:06:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-11-07 05:06:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2020-11-07 05:06:30,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-11-07 05:06:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2020-11-07 05:06:30,464 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 34 [2020-11-07 05:06:30,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:30,465 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2020-11-07 05:06:30,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:06:30,465 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2020-11-07 05:06:30,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:06:30,467 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:30,467 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, 1, 1] [2020-11-07 05:06:30,467 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-07 05:06:30,468 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:30,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:30,468 INFO L82 PathProgramCache]: Analyzing trace with hash 935446002, now seen corresponding path program 1 times [2020-11-07 05:06:30,469 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:30,469 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [971971669] [2020-11-07 05:06:30,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:30,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:30,580 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:30,593 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:30,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:30,632 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:30,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:30,681 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:06:30,702 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [971971669] [2020-11-07 05:06:30,702 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:30,702 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-07 05:06:30,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924251474] [2020-11-07 05:06:30,703 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-07 05:06:30,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:30,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-07 05:06:30,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-07 05:06:30,705 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 6 states. [2020-11-07 05:06:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:31,051 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2020-11-07 05:06:31,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-07 05:06:31,051 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2020-11-07 05:06:31,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:31,053 INFO L225 Difference]: With dead ends: 79 [2020-11-07 05:06:31,053 INFO L226 Difference]: Without dead ends: 59 [2020-11-07 05:06:31,054 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-11-07 05:06:31,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2020-11-07 05:06:31,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2020-11-07 05:06:31,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2020-11-07 05:06:31,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2020-11-07 05:06:31,071 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 43 [2020-11-07 05:06:31,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:31,072 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2020-11-07 05:06:31,072 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-07 05:06:31,072 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2020-11-07 05:06:31,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:06:31,074 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:31,074 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, 1, 1] [2020-11-07 05:06:31,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-07 05:06:31,074 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:31,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:31,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1355534926, now seen corresponding path program 1 times [2020-11-07 05:06:31,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:31,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1021391610] [2020-11-07 05:06:31,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:31,126 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:31,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:31,133 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:31,211 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:31,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:31,260 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:31,294 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:06:31,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1021391610] [2020-11-07 05:06:31,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:31,295 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 05:06:31,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464709975] [2020-11-07 05:06:31,297 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:06:31,297 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:31,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:06:31,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:06:31,299 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2020-11-07 05:06:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:31,916 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2020-11-07 05:06:31,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:06:31,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2020-11-07 05:06:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:31,918 INFO L225 Difference]: With dead ends: 85 [2020-11-07 05:06:31,918 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 05:06:31,920 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:06:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 05:06:31,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2020-11-07 05:06:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-11-07 05:06:31,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2020-11-07 05:06:31,939 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 43 [2020-11-07 05:06:31,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:31,939 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2020-11-07 05:06:31,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:06:31,939 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2020-11-07 05:06:31,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2020-11-07 05:06:31,941 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:31,941 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, 1, 1] [2020-11-07 05:06:31,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-07 05:06:31,941 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:31,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:31,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1484823182, now seen corresponding path program 1 times [2020-11-07 05:06:31,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:31,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1227407820] [2020-11-07 05:06:31,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:32,018 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:32,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:32,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:32,117 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:32,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:32,191 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:32,233 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-11-07 05:06:32,233 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1227407820] [2020-11-07 05:06:32,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:32,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:06:32,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543938805] [2020-11-07 05:06:32,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:06:32,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:32,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:06:32,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:06:32,238 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand 12 states. [2020-11-07 05:06:33,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:33,124 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2020-11-07 05:06:33,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:06:33,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2020-11-07 05:06:33,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:33,126 INFO L225 Difference]: With dead ends: 71 [2020-11-07 05:06:33,126 INFO L226 Difference]: Without dead ends: 65 [2020-11-07 05:06:33,127 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:06:33,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-11-07 05:06:33,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 57. [2020-11-07 05:06:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-11-07 05:06:33,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2020-11-07 05:06:33,144 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 43 [2020-11-07 05:06:33,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:33,145 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2020-11-07 05:06:33,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:06:33,145 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2020-11-07 05:06:33,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 05:06:33,146 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:33,146 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:33,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-07 05:06:33,147 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:33,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:33,148 INFO L82 PathProgramCache]: Analyzing trace with hash 463887169, now seen corresponding path program 1 times [2020-11-07 05:06:33,148 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:33,148 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [483706379] [2020-11-07 05:06:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:33,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:33,195 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:33,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:33,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:33,220 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:33,273 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:33,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:33,316 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:33,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 05:06:33,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [483706379] [2020-11-07 05:06:33,343 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-07 05:06:33,343 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-07 05:06:33,343 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841798827] [2020-11-07 05:06:33,344 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-07 05:06:33,344 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:33,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-07 05:06:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-11-07 05:06:33,345 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 9 states. [2020-11-07 05:06:33,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:33,930 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2020-11-07 05:06:33,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-07 05:06:33,931 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2020-11-07 05:06:33,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:33,933 INFO L225 Difference]: With dead ends: 91 [2020-11-07 05:06:33,933 INFO L226 Difference]: Without dead ends: 71 [2020-11-07 05:06:33,934 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-11-07 05:06:33,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2020-11-07 05:06:33,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2020-11-07 05:06:33,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2020-11-07 05:06:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2020-11-07 05:06:33,957 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 52 [2020-11-07 05:06:33,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:33,957 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2020-11-07 05:06:33,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-07 05:06:33,957 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2020-11-07 05:06:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 05:06:33,959 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:33,959 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-07 05:06:33,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-07 05:06:33,960 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:33,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1827093759, now seen corresponding path program 1 times [2020-11-07 05:06:33,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:33,961 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [383210163] [2020-11-07 05:06:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:34,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:34,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:34,013 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:34,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:34,056 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:34,105 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:34,166 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:34,195 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 05:06:34,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [383210163] [2020-11-07 05:06:34,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:34,196 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:06:34,196 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735386360] [2020-11-07 05:06:34,197 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:06:34,197 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:34,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:06:34,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:06:34,198 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 12 states. [2020-11-07 05:06:34,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:34,990 INFO L93 Difference]: Finished difference Result 97 states and 105 transitions. [2020-11-07 05:06:34,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:06:34,993 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2020-11-07 05:06:34,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:34,995 INFO L225 Difference]: With dead ends: 97 [2020-11-07 05:06:34,995 INFO L226 Difference]: Without dead ends: 77 [2020-11-07 05:06:34,997 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:06:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2020-11-07 05:06:35,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2020-11-07 05:06:35,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2020-11-07 05:06:35,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2020-11-07 05:06:35,043 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 52 [2020-11-07 05:06:35,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:35,043 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2020-11-07 05:06:35,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:06:35,044 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2020-11-07 05:06:35,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-07 05:06:35,045 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:35,050 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-07 05:06:35,051 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-07 05:06:35,051 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1956382015, now seen corresponding path program 1 times [2020-11-07 05:06:35,052 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:35,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1691002505] [2020-11-07 05:06:35,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:35,157 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:35,167 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:35,213 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:35,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:35,274 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:35,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:35,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-11-07 05:06:35,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1691002505] [2020-11-07 05:06:35,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:35,374 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:06:35,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958096033] [2020-11-07 05:06:35,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:06:35,375 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:06:35,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:06:35,376 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand 15 states. [2020-11-07 05:06:36,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:36,484 INFO L93 Difference]: Finished difference Result 85 states and 90 transitions. [2020-11-07 05:06:36,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:06:36,485 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 52 [2020-11-07 05:06:36,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:36,486 INFO L225 Difference]: With dead ends: 85 [2020-11-07 05:06:36,486 INFO L226 Difference]: Without dead ends: 79 [2020-11-07 05:06:36,489 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:06:36,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-11-07 05:06:36,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 63. [2020-11-07 05:06:36,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2020-11-07 05:06:36,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2020-11-07 05:06:36,528 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 52 [2020-11-07 05:06:36,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:36,529 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2020-11-07 05:06:36,529 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:06:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2020-11-07 05:06:36,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:06:36,530 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:36,530 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, 1, 1, 1, 1] [2020-11-07 05:06:36,531 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-07 05:06:36,531 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:36,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:36,531 INFO L82 PathProgramCache]: Analyzing trace with hash -1484609405, now seen corresponding path program 1 times [2020-11-07 05:06:36,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:36,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1019895354] [2020-11-07 05:06:36,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:36,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:36,600 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:36,608 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:36,648 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:36,715 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:36,758 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:36,826 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:36,870 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 05:06:36,871 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1019895354] [2020-11-07 05:06:36,871 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:36,871 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2020-11-07 05:06:36,872 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717878271] [2020-11-07 05:06:36,872 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-07 05:06:36,872 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:36,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-07 05:06:36,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-11-07 05:06:36,873 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 12 states. [2020-11-07 05:06:37,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:37,704 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2020-11-07 05:06:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-07 05:06:37,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2020-11-07 05:06:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:37,709 INFO L225 Difference]: With dead ends: 105 [2020-11-07 05:06:37,709 INFO L226 Difference]: Without dead ends: 83 [2020-11-07 05:06:37,711 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-11-07 05:06:37,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2020-11-07 05:06:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2020-11-07 05:06:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-11-07 05:06:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2020-11-07 05:06:37,743 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 61 [2020-11-07 05:06:37,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:37,744 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2020-11-07 05:06:37,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-07 05:06:37,749 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2020-11-07 05:06:37,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-11-07 05:06:37,750 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:37,750 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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] [2020-11-07 05:06:37,750 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-07 05:06:37,751 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:37,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:37,751 INFO L82 PathProgramCache]: Analyzing trace with hash 519376963, now seen corresponding path program 2 times [2020-11-07 05:06:37,751 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:37,752 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [897461890] [2020-11-07 05:06:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:37,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:37,831 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:37,846 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:37,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:37,890 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:37,934 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:37,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:37,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:38,060 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:38,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:38,108 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-11-07 05:06:38,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [897461890] [2020-11-07 05:06:38,109 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:38,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:06:38,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592068773] [2020-11-07 05:06:38,111 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:06:38,112 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:38,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:06:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:06:38,115 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand 15 states. [2020-11-07 05:06:39,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:39,191 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2020-11-07 05:06:39,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:06:39,191 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 61 [2020-11-07 05:06:39,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:39,193 INFO L225 Difference]: With dead ends: 113 [2020-11-07 05:06:39,193 INFO L226 Difference]: Without dead ends: 91 [2020-11-07 05:06:39,194 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:06:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-11-07 05:06:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 86. [2020-11-07 05:06:39,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2020-11-07 05:06:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2020-11-07 05:06:39,232 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 61 [2020-11-07 05:06:39,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:39,233 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2020-11-07 05:06:39,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:06:39,233 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2020-11-07 05:06:39,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-07 05:06:39,235 INFO L414 BasicCegarLoop]: Found error trace [2020-11-07 05:06:39,236 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-11-07 05:06:39,237 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-07 05:06:39,237 INFO L429 AbstractCegarLoop]: === Iteration 12 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-07 05:06:39,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-07 05:06:39,238 INFO L82 PathProgramCache]: Analyzing trace with hash -123538722, now seen corresponding path program 2 times [2020-11-07 05:06:39,239 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-11-07 05:06:39,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1699942098] [2020-11-07 05:06:39,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-07 05:06:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:39,307 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-07 05:06:39,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:39,312 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2020-11-07 05:06:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:39,329 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:39,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:39,368 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:39,408 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:39,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:39,547 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-11-07 05:06:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-07 05:06:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-07 05:06:39,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1699942098] [2020-11-07 05:06:39,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-11-07 05:06:39,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-11-07 05:06:39,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363618621] [2020-11-07 05:06:39,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-11-07 05:06:39,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-11-07 05:06:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-11-07 05:06:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-11-07 05:06:39,588 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand 15 states. [2020-11-07 05:06:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-07 05:06:40,652 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2020-11-07 05:06:40,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-11-07 05:06:40,653 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 70 [2020-11-07 05:06:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-07 05:06:40,653 INFO L225 Difference]: With dead ends: 102 [2020-11-07 05:06:40,654 INFO L226 Difference]: Without dead ends: 0 [2020-11-07 05:06:40,655 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2020-11-07 05:06:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-07 05:06:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-07 05:06:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-07 05:06:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-07 05:06:40,657 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 70 [2020-11-07 05:06:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-07 05:06:40,658 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-07 05:06:40,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-11-07 05:06:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-07 05:06:40,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-07 05:06:40,658 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-07 05:06:40,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-07 05:06:41,699 WARN L194 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 26 [2020-11-07 05:06:41,980 WARN L194 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 23 [2020-11-07 05:06:42,155 WARN L194 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 22 [2020-11-07 05:06:42,400 WARN L194 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 31 [2020-11-07 05:06:42,515 WARN L194 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-11-07 05:06:42,780 WARN L194 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 30 [2020-11-07 05:06:42,967 WARN L194 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 24 [2020-11-07 05:06:43,146 WARN L194 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 23 [2020-11-07 05:06:43,255 INFO L269 CegarLoopResult]: At program point reach_errorEXIT(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,256 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,256 INFO L269 CegarLoopResult]: At program point reach_errorFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,256 INFO L269 CegarLoopResult]: At program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,256 INFO L269 CegarLoopResult]: At program point L4-3(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,256 INFO L269 CegarLoopResult]: At program point L4-4(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,257 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:43,257 INFO L269 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:43,257 INFO L269 CegarLoopResult]: At program point ULTIMATE.initFINAL(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,257 INFO L262 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-11-07 05:06:43,257 INFO L269 CegarLoopResult]: At program point L4(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,257 INFO L269 CegarLoopResult]: At program point L4-1(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,258 INFO L269 CegarLoopResult]: At program point L4-2(line 4) the Hoare annotation is: true [2020-11-07 05:06:43,258 INFO L269 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:06:43,258 INFO L262 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-11-07 05:06:43,258 INFO L262 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (or (and (<= id2_~ret~1 2) (<= 2 id2_~ret~1)) (and (<= 1 id2_~ret~1) (<= id2_~ret~1 1)) (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3))) [2020-11-07 05:06:43,258 INFO L262 CegarLoopResult]: At program point id2FINAL(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-11-07 05:06:43,258 INFO L269 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: true [2020-11-07 05:06:43,259 INFO L262 CegarLoopResult]: At program point L19-1(line 19) the Hoare annotation is: (and (<= 4 id2_~ret~1) (<= (div id2_~ret~1 4294967296) 0)) [2020-11-07 05:06:43,259 INFO L269 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: true [2020-11-07 05:06:43,259 INFO L262 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= |id2_#t~ret8| 0)) (and (<= 2 |id2_#t~ret8|) (<= |id2_#t~ret8| 2)) (and (<= 3 |id2_#t~ret8|) (<= |id2_#t~ret8| 3)) (and (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|))) [2020-11-07 05:06:43,259 INFO L269 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-11-07 05:06:43,259 INFO L262 CegarLoopResult]: At program point L18-2(line 18) the Hoare annotation is: (or (and (<= 0 |id2_#t~ret8|) (<= 1 id2_~ret~1) (<= |id2_#t~ret8| 0) (<= id2_~ret~1 1)) (and (<= id2_~ret~1 2) (<= |id2_#t~ret8| 1) (<= 1 |id2_#t~ret8|) (<= 2 id2_~ret~1)) (and (<= 3 id2_~ret~1) (<= id2_~ret~1 3) (<= |id2_#t~ret8| 2) (<= 2 |id2_#t~ret8|)) (and (<= 3 |id2_#t~ret8|) (<= 4 id2_~ret~1) (<= |id2_#t~ret8| 3) (<= (div id2_~ret~1 4294967296) 0))) [2020-11-07 05:06:43,259 INFO L262 CegarLoopResult]: At program point id2EXIT(lines 16 21) the Hoare annotation is: (or (and (<= 1 id2_~ret~1) (<= |id2_#res| 1) (<= id2_~ret~1 1) (<= 1 |id2_#res|)) (and (<= |id2_#res| 0) (<= 0 |id2_#res|)) (and (<= 2 |id2_#res|) (<= id2_~ret~1 2) (<= |id2_#res| 2) (<= 2 id2_~ret~1)) (and (<= |id2_#res| 3) (<= 3 |id2_#res|))) [2020-11-07 05:06:43,259 INFO L269 CegarLoopResult]: At program point id2ENTRY(lines 16 21) the Hoare annotation is: true [2020-11-07 05:06:43,259 INFO L269 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-11-07 05:06:43,260 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-07 05:06:43,260 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-07 05:06:43,260 INFO L269 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-11-07 05:06:43,260 INFO L269 CegarLoopResult]: At program point mainENTRY(lines 23 29) the Hoare annotation is: true [2020-11-07 05:06:43,260 INFO L262 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: false [2020-11-07 05:06:43,260 INFO L262 CegarLoopResult]: At program point L26(lines 26 28) the Hoare annotation is: (and (<= main_~result~0 3) (< 0 (+ (div main_~result~0 4294967296) 1))) [2020-11-07 05:06:43,260 INFO L262 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: false [2020-11-07 05:06:43,261 INFO L269 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: true [2020-11-07 05:06:43,261 INFO L269 CegarLoopResult]: At program point mainEXIT(lines 23 29) the Hoare annotation is: true [2020-11-07 05:06:43,261 INFO L269 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: true [2020-11-07 05:06:43,261 INFO L262 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (or (and (<= |main_#t~ret10| 3) (<= 3 |main_#t~ret10|)) (and (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|)) (= |main_#t~ret10| 0) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|))) [2020-11-07 05:06:43,261 INFO L269 CegarLoopResult]: At program point L26-2(lines 23 29) the Hoare annotation is: true [2020-11-07 05:06:43,261 INFO L262 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div main_~result~0 4294967296) 1)))) (or (and (<= main_~result~0 3) (<= |main_#t~ret10| 3) .cse0 (<= 3 |main_#t~ret10|)) (and (<= |main_#t~ret10| 1) (<= 1 |main_#t~ret10|) (<= main_~result~0 1) .cse0) (and (= main_~result~0 0) (= |main_#t~ret10| 0)) (and (<= main_~result~0 2) (<= |main_#t~ret10| 2) (<= 2 |main_#t~ret10|) .cse0))) [2020-11-07 05:06:43,262 INFO L262 CegarLoopResult]: At program point idFINAL(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-11-07 05:06:43,262 INFO L262 CegarLoopResult]: At program point idEXIT(lines 9 14) the Hoare annotation is: (or (and (<= |id_#res| 1) (<= id_~ret~0 1) (<= 1 |id_#res|) (<= 1 id_~ret~0)) (and (<= id_~ret~0 2) (<= 2 |id_#res|) (<= |id_#res| 2) (<= 2 id_~ret~0)) (and (<= 0 |id_#res|) (<= |id_#res| 0)) (and (<= |id_#res| 3) (<= 3 |id_#res|))) [2020-11-07 05:06:43,262 INFO L269 CegarLoopResult]: At program point idENTRY(lines 9 14) the Hoare annotation is: true [2020-11-07 05:06:43,262 INFO L262 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: (or (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-11-07 05:06:43,262 INFO L262 CegarLoopResult]: At program point L12(line 12) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= (div id_~ret~0 4294967296) 0)) (and (<= id_~ret~0 2) (<= 2 id_~ret~0)) (and (<= 3 id_~ret~0) (<= id_~ret~0 3)) (and (<= id_~ret~0 1) (<= 1 id_~ret~0))) [2020-11-07 05:06:43,262 INFO L269 CegarLoopResult]: At program point L11(line 11) the Hoare annotation is: true [2020-11-07 05:06:43,262 INFO L269 CegarLoopResult]: At program point L12-1(line 12) the Hoare annotation is: true [2020-11-07 05:06:43,262 INFO L269 CegarLoopResult]: At program point L10(line 10) the Hoare annotation is: true [2020-11-07 05:06:43,263 INFO L262 CegarLoopResult]: At program point L11-1(line 11) the Hoare annotation is: (or (and (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|)) (and (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|)) (and (<= 0 |id_#t~ret7|) (<= |id_#t~ret7| 0)) (and (<= 3 |id_#t~ret7|) (<= |id_#t~ret7| 3))) [2020-11-07 05:06:43,263 INFO L269 CegarLoopResult]: At program point L10-1(line 10) the Hoare annotation is: true [2020-11-07 05:06:43,263 INFO L262 CegarLoopResult]: At program point L11-2(line 11) the Hoare annotation is: (or (and (<= 4 id_~ret~0) (<= 3 |id_#t~ret7|) (<= (div id_~ret~0 4294967296) 0) (<= |id_#t~ret7| 3)) (and (<= 3 id_~ret~0) (<= |id_#t~ret7| 2) (<= 2 |id_#t~ret7|) (<= id_~ret~0 3)) (and (<= id_~ret~0 2) (<= |id_#t~ret7| 1) (<= 1 |id_#t~ret7|) (<= 2 id_~ret~0)) (and (<= 0 |id_#t~ret7|) (<= id_~ret~0 1) (<= |id_#t~ret7| 0) (<= 1 id_~ret~0))) [2020-11-07 05:06:43,282 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 05:06:43 BoogieIcfgContainer [2020-11-07 05:06:43,283 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-07 05:06:43,284 INFO L168 Benchmark]: Toolchain (without parser) took 16281.67 ms. Allocated memory was 172.0 MB in the beginning and 373.3 MB in the end (delta: 201.3 MB). Free memory was 128.7 MB in the beginning and 139.4 MB in the end (delta: -10.7 MB). Peak memory consumption was 195.9 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:43,285 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 172.0 MB. Free memory is still 145.1 MB. There was no memory consumed. Max. memory is 8.0 GB. [2020-11-07 05:06:43,287 INFO L168 Benchmark]: CACSL2BoogieTranslator took 294.04 ms. Allocated memory is still 172.0 MB. Free memory was 128.0 MB in the beginning and 153.3 MB in the end (delta: -25.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:43,287 INFO L168 Benchmark]: Boogie Preprocessor took 33.63 ms. Allocated memory is still 172.0 MB. Free memory was 153.3 MB in the beginning and 151.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:43,288 INFO L168 Benchmark]: RCFGBuilder took 414.20 ms. Allocated memory is still 172.0 MB. Free memory was 151.8 MB in the beginning and 142.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:43,289 INFO L168 Benchmark]: TraceAbstraction took 15521.36 ms. Allocated memory was 172.0 MB in the beginning and 373.3 MB in the end (delta: 201.3 MB). Free memory was 141.7 MB in the beginning and 139.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 208.7 MB. Max. memory is 8.0 GB. [2020-11-07 05:06:43,292 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 172.0 MB. Free memory is still 145.1 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 294.04 ms. Allocated memory is still 172.0 MB. Free memory was 128.0 MB in the beginning and 153.3 MB in the end (delta: -25.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.63 ms. Allocated memory is still 172.0 MB. Free memory was 153.3 MB in the beginning and 151.8 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 414.20 ms. Allocated memory is still 172.0 MB. Free memory was 151.8 MB in the beginning and 142.3 MB in the end (delta: 9.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 15521.36 ms. Allocated memory was 172.0 MB in the beginning and 373.3 MB in the end (delta: 201.3 MB). Free memory was 141.7 MB in the beginning and 139.4 MB in the end (delta: 2.2 MB). Peak memory consumption was 208.7 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: 16]: Procedure Contract for id2 Derived contract for procedure id2: (((((1 <= ret && \result <= 1) && ret <= 1) && 1 <= \result) || (\result <= 0 && 0 <= \result)) || (((2 <= \result && ret <= 2) && \result <= 2) && 2 <= ret)) || (\result <= 3 && 3 <= \result) - ProcedureContractResult [Line: 23]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 9]: Procedure Contract for id Derived contract for procedure id: (((((\result <= 1 && ret <= 1) && 1 <= \result) && 1 <= ret) || (((ret <= 2 && 2 <= \result) && \result <= 2) && 2 <= ret)) || (0 <= \result && \result <= 0)) || (\result <= 3 && 3 <= \result) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 50 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 12.7s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 528 SDtfs, 504 SDslu, 1471 SDs, 0 SdLazy, 3843 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 6.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 49 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 50 LocationsWithAnnotation, 105 PreInvPairs, 247 NumberOfFragments, 606 HoareAnnotationTreeSize, 105 FomulaSimplifications, 68689 FormulaSimplificationTreeSizeReduction, 0.8s HoareSimplificationTime, 50 FomulaSimplificationsInter, 5206 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 570 NumberOfCodeBlocks, 570 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 99750 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 102/144 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...