/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 23:29:14,352 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 23:29:14,354 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 23:29:14,383 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 23:29:14,384 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 23:29:14,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 23:29:14,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 23:29:14,388 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 23:29:14,389 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 23:29:14,390 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 23:29:14,391 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 23:29:14,392 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 23:29:14,393 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 23:29:14,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 23:29:14,395 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 23:29:14,396 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 23:29:14,396 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 23:29:14,397 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 23:29:14,399 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 23:29:14,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 23:29:14,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 23:29:14,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 23:29:14,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 23:29:14,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 23:29:14,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 23:29:14,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 23:29:14,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 23:29:14,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 23:29:14,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 23:29:14,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 23:29:14,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 23:29:14,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 23:29:14,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 23:29:14,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 23:29:14,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 23:29:14,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 23:29:14,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 23:29:14,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 23:29:14,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 23:29:14,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 23:29:14,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 23:29:14,417 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-02 23:29:14,427 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 23:29:14,428 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 23:29:14,429 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 23:29:14,430 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 23:29:14,430 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 23:29:14,430 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 23:29:14,430 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 23:29:14,430 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 23:29:14,431 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 23:29:14,431 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 23:29:14,431 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 23:29:14,431 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 23:29:14,431 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 23:29:14,432 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 23:29:14,432 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 23:29:14,432 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 23:29:14,432 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-02 23:29:14,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 23:29:14,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 23:29:14,433 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 23:29:14,433 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-02 23:29:14,433 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 23:29:14,433 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-02 23:29:14,433 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 23:29:14,801 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 23:29:14,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 23:29:14,838 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 23:29:14,840 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 23:29:14,840 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 23:29:14,841 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2021-05-02 23:29:14,935 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de03fed0a/1b66363fe31a43b0aa0c2f1c6977649e/FLAGa7623a47d [2021-05-02 23:29:15,555 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 23:29:15,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c [2021-05-02 23:29:15,569 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de03fed0a/1b66363fe31a43b0aa0c2f1c6977649e/FLAGa7623a47d [2021-05-02 23:29:15,945 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de03fed0a/1b66363fe31a43b0aa0c2f1c6977649e [2021-05-02 23:29:15,948 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 23:29:15,951 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 23:29:15,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 23:29:15,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 23:29:15,960 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 23:29:15,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:29:15" (1/1) ... [2021-05-02 23:29:15,962 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63476f56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:15, skipping insertion in model container [2021-05-02 23:29:15,962 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:29:15" (1/1) ... [2021-05-02 23:29:15,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 23:29:15,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 23:29:16,129 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2021-05-02 23:29:16,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:29:16,151 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 23:29:16,163 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/underapprox_1-2.c[327,340] [2021-05-02 23:29:16,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 23:29:16,187 INFO L208 MainTranslator]: Completed translation [2021-05-02 23:29:16,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16 WrapperNode [2021-05-02 23:29:16,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 23:29:16,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 23:29:16,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 23:29:16,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 23:29:16,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (1/1) ... [2021-05-02 23:29:16,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (1/1) ... [2021-05-02 23:29:16,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (1/1) ... [2021-05-02 23:29:16,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (1/1) ... [2021-05-02 23:29:16,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (1/1) ... [2021-05-02 23:29:16,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (1/1) ... [2021-05-02 23:29:16,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (1/1) ... [2021-05-02 23:29:16,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 23:29:16,271 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 23:29:16,271 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 23:29:16,271 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 23:29:16,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (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 [2021-05-02 23:29:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 23:29:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 23:29:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 23:29:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 23:29:16,374 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 23:29:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 23:29:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 23:29:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 23:29:16,375 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 23:29:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 23:29:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 23:29:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 23:29:16,376 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 23:29:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 23:29:16,377 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 23:29:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 23:29:16,378 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 23:29:16,633 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 23:29:16,634 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 23:29:16,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:29:16 BoogieIcfgContainer [2021-05-02 23:29:16,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 23:29:16,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 23:29:16,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 23:29:16,640 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 23:29:16,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:29:15" (1/3) ... [2021-05-02 23:29:16,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a3c144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:29:16, skipping insertion in model container [2021-05-02 23:29:16,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:29:16" (2/3) ... [2021-05-02 23:29:16,642 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68a3c144 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:29:16, skipping insertion in model container [2021-05-02 23:29:16,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:29:16" (3/3) ... [2021-05-02 23:29:16,643 INFO L111 eAbstractionObserver]: Analyzing ICFG underapprox_1-2.c [2021-05-02 23:29:16,648 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-02 23:29:16,652 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 23:29:16,669 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 23:29:16,687 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 23:29:16,688 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 23:29:16,688 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-02 23:29:16,688 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 23:29:16,688 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 23:29:16,688 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 23:29:16,688 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 23:29:16,689 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 23:29:16,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-05-02 23:29:16,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:29:16,708 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:16,709 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:16,709 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash -219174432, now seen corresponding path program 1 times [2021-05-02 23:29:16,721 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:16,722 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [845929135] [2021-05-02 23:29:16,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:16,833 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,020 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:17,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:17,046 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:17,047 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [845929135] [2021-05-02 23:29:17,049 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [845929135] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:17,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:17,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 23:29:17,052 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876811239] [2021-05-02 23:29:17,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 23:29:17,058 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:17,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 23:29:17,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:29:17,075 INFO L87 Difference]: Start difference. First operand has 18 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:17,146 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2021-05-02 23:29:17,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 23:29:17,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 23:29:17,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:17,154 INFO L225 Difference]: With dead ends: 29 [2021-05-02 23:29:17,154 INFO L226 Difference]: Without dead ends: 12 [2021-05-02 23:29:17,157 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 58.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 23:29:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2021-05-02 23:29:17,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-05-02 23:29:17,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2021-05-02 23:29:17,185 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 11 [2021-05-02 23:29:17,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:17,186 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2021-05-02 23:29:17,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,186 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2021-05-02 23:29:17,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-05-02 23:29:17,187 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:17,187 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:17,187 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 23:29:17,187 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:17,188 INFO L82 PathProgramCache]: Analyzing trace with hash -222868516, now seen corresponding path program 1 times [2021-05-02 23:29:17,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:17,189 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [95401856] [2021-05-02 23:29:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:17,192 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:17,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,262 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:17,279 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:17,279 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [95401856] [2021-05-02 23:29:17,279 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [95401856] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:17,279 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:17,279 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 23:29:17,280 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024215130] [2021-05-02 23:29:17,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 23:29:17,281 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:17,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 23:29:17,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 23:29:17,282 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:17,348 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2021-05-02 23:29:17,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 23:29:17,349 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2021-05-02 23:29:17,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:17,350 INFO L225 Difference]: With dead ends: 18 [2021-05-02 23:29:17,350 INFO L226 Difference]: Without dead ends: 13 [2021-05-02 23:29:17,352 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:29:17,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2021-05-02 23:29:17,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2021-05-02 23:29:17,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2021-05-02 23:29:17,358 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2021-05-02 23:29:17,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:17,358 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2021-05-02 23:29:17,358 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2021-05-02 23:29:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-05-02 23:29:17,359 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:17,359 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:17,359 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 23:29:17,359 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1717471862, now seen corresponding path program 1 times [2021-05-02 23:29:17,360 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:17,360 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [366239648] [2021-05-02 23:29:17,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:17,384 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:29:17,390 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:17,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,526 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:17,541 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:17,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [366239648] [2021-05-02 23:29:17,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [366239648] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:17,541 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:17,541 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 23:29:17,541 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110947792] [2021-05-02 23:29:17,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 23:29:17,542 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:17,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 23:29:17,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 23:29:17,543 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:17,616 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-05-02 23:29:17,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 23:29:17,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2021-05-02 23:29:17,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:17,617 INFO L225 Difference]: With dead ends: 19 [2021-05-02 23:29:17,617 INFO L226 Difference]: Without dead ends: 14 [2021-05-02 23:29:17,618 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 93.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:29:17,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2021-05-02 23:29:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2021-05-02 23:29:17,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2021-05-02 23:29:17,622 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2021-05-02 23:29:17,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:17,623 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2021-05-02 23:29:17,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,623 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2021-05-02 23:29:17,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-02 23:29:17,624 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:17,624 INFO L523 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:17,624 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 23:29:17,624 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:17,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:17,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1738481436, now seen corresponding path program 2 times [2021-05-02 23:29:17,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:17,625 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [284553373] [2021-05-02 23:29:17,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:17,629 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:29:17,630 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:17,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,706 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:17,715 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:17,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [284553373] [2021-05-02 23:29:17,716 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [284553373] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:17,716 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:17,716 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 23:29:17,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827491467] [2021-05-02 23:29:17,716 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 23:29:17,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 23:29:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-02 23:29:17,718 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:17,836 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2021-05-02 23:29:17,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 23:29:17,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-02 23:29:17,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:17,837 INFO L225 Difference]: With dead ends: 20 [2021-05-02 23:29:17,837 INFO L226 Difference]: Without dead ends: 15 [2021-05-02 23:29:17,838 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 114.3ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:29:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2021-05-02 23:29:17,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2021-05-02 23:29:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2021-05-02 23:29:17,844 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2021-05-02 23:29:17,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:17,844 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2021-05-02 23:29:17,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:17,844 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2021-05-02 23:29:17,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-02 23:29:17,845 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:17,845 INFO L523 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:17,845 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 23:29:17,845 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:17,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:17,846 INFO L82 PathProgramCache]: Analyzing trace with hash -1905189066, now seen corresponding path program 3 times [2021-05-02 23:29:17,846 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:17,846 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1494252236] [2021-05-02 23:29:17,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:17,850 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:29:17,852 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,940 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:17,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:17,949 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:17,949 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1494252236] [2021-05-02 23:29:17,949 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1494252236] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:17,949 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:17,949 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 23:29:17,949 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826947837] [2021-05-02 23:29:17,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 23:29:17,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:17,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 23:29:17,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-05-02 23:29:17,951 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:18,095 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2021-05-02 23:29:18,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 23:29:18,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-02 23:29:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:18,097 INFO L225 Difference]: With dead ends: 21 [2021-05-02 23:29:18,097 INFO L226 Difference]: Without dead ends: 16 [2021-05-02 23:29:18,099 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 144.7ms TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2021-05-02 23:29:18,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-05-02 23:29:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-05-02 23:29:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-05-02 23:29:18,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2021-05-02 23:29:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:18,107 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-05-02 23:29:18,107 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,108 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-05-02 23:29:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-02 23:29:18,108 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:18,108 INFO L523 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:18,109 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-02 23:29:18,110 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:18,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:18,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1105142364, now seen corresponding path program 4 times [2021-05-02 23:29:18,111 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:18,111 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1139604363] [2021-05-02 23:29:18,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:18,118 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:29:18,120 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:18,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:18,246 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:18,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:18,272 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:18,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1139604363] [2021-05-02 23:29:18,272 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1139604363] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:18,272 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:18,273 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-05-02 23:29:18,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165059318] [2021-05-02 23:29:18,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 23:29:18,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:18,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 23:29:18,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 23:29:18,275 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:18,482 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2021-05-02 23:29:18,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 23:29:18,483 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-02 23:29:18,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:18,485 INFO L225 Difference]: With dead ends: 22 [2021-05-02 23:29:18,485 INFO L226 Difference]: Without dead ends: 17 [2021-05-02 23:29:18,485 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 209.3ms TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2021-05-02 23:29:18,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2021-05-02 23:29:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2021-05-02 23:29:18,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2021-05-02 23:29:18,494 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2021-05-02 23:29:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:18,494 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2021-05-02 23:29:18,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 1.375) internal successors, (11), 7 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2021-05-02 23:29:18,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-05-02 23:29:18,496 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:18,496 INFO L523 BasicCegarLoop]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:18,496 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-02 23:29:18,496 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:18,497 INFO L82 PathProgramCache]: Analyzing trace with hash -63863818, now seen corresponding path program 5 times [2021-05-02 23:29:18,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:18,498 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [695867306] [2021-05-02 23:29:18,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:18,513 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:29:18,515 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:18,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:18,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:18,706 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:18,706 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [695867306] [2021-05-02 23:29:18,706 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [695867306] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:18,707 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:18,707 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-02 23:29:18,707 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512695723] [2021-05-02 23:29:18,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 23:29:18,707 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 23:29:18,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-05-02 23:29:18,709 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:18,938 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2021-05-02 23:29:18,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 23:29:18,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2021-05-02 23:29:18,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:18,940 INFO L225 Difference]: With dead ends: 23 [2021-05-02 23:29:18,940 INFO L226 Difference]: Without dead ends: 18 [2021-05-02 23:29:18,941 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 264.9ms TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2021-05-02 23:29:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2021-05-02 23:29:18,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2021-05-02 23:29:18,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2021-05-02 23:29:18,945 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2021-05-02 23:29:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:18,945 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2021-05-02 23:29:18,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 8 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2021-05-02 23:29:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-05-02 23:29:18,946 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:18,946 INFO L523 BasicCegarLoop]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:18,946 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-02 23:29:18,946 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:18,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1943317092, now seen corresponding path program 6 times [2021-05-02 23:29:18,947 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:18,947 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [263471046] [2021-05-02 23:29:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:18,958 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:29:18,960 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:19,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:19,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:19,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:19,803 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:19,803 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [263471046] [2021-05-02 23:29:19,803 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [263471046] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:19,804 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:19,804 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-05-02 23:29:19,804 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040622971] [2021-05-02 23:29:19,804 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 23:29:19,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:19,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 23:29:19,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2021-05-02 23:29:19,805 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:23,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:23,091 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2021-05-02 23:29:23,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-02 23:29:23,092 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2021-05-02 23:29:23,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:23,092 INFO L225 Difference]: With dead ends: 24 [2021-05-02 23:29:23,092 INFO L226 Difference]: Without dead ends: 19 [2021-05-02 23:29:23,093 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 3348.3ms TimeCoverageRelationStatistics Valid=66, Invalid=353, Unknown=1, NotChecked=0, Total=420 [2021-05-02 23:29:23,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2021-05-02 23:29:23,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2021-05-02 23:29:23,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:23,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2021-05-02 23:29:23,099 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2021-05-02 23:29:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:23,099 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2021-05-02 23:29:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 10 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2021-05-02 23:29:23,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 23:29:23,100 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 23:29:23,100 INFO L523 BasicCegarLoop]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 23:29:23,100 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-05-02 23:29:23,100 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 23:29:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 23:29:23,101 INFO L82 PathProgramCache]: Analyzing trace with hash -76826442, now seen corresponding path program 7 times [2021-05-02 23:29:23,101 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-02 23:29:23,101 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1943094824] [2021-05-02 23:29:23,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 23:29:23,119 WARN L74 AcceleratorJordan]: Jordan acceleration failed, because UNSUPPORTED_EIGENVALUES [2021-05-02 23:29:23,120 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-02 23:29:23,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:23,258 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 23:29:23,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 23:29:23,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 23:29:23,264 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-02 23:29:23,265 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1943094824] [2021-05-02 23:29:23,265 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1943094824] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 23:29:23,265 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 23:29:23,265 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-05-02 23:29:23,265 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559023359] [2021-05-02 23:29:23,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 23:29:23,265 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-02 23:29:23,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 23:29:23,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2021-05-02 23:29:23,266 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:23,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 23:29:23,516 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-05-02 23:29:23,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-02 23:29:23,516 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2021-05-02 23:29:23,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 23:29:23,517 INFO L225 Difference]: With dead ends: 19 [2021-05-02 23:29:23,517 INFO L226 Difference]: Without dead ends: 0 [2021-05-02 23:29:23,518 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 286.5ms TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2021-05-02 23:29:23,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-02 23:29:23,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-02 23:29:23,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-05-02 23:29:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-02 23:29:23,518 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2021-05-02 23:29:23,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 23:29:23,519 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-02 23:29:23,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 9 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-02 23:29:23,519 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-02 23:29:23,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-02 23:29:23,519 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 23:29:23,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-02 23:29:26,470 WARN L205 SmtUtils]: Spent 2.81 s on a formula simplification. DAG size of input: 127 DAG size of output: 105 [2021-05-02 23:29:26,522 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2021-05-02 23:29:26,522 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2021-05-02 23:29:26,522 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2021-05-02 23:29:26,523 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:29:26,523 INFO L194 CegarLoopUtils]: 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|)) [2021-05-02 23:29:26,523 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:29:26,523 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-02 23:29:26,523 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-02 23:29:26,523 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-02 23:29:26,523 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-02 23:29:26,524 INFO L201 CegarLoopUtils]: At program point mainENTRY(lines 12 22) the Hoare annotation is: true [2021-05-02 23:29:26,524 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 12 22) the Hoare annotation is: true [2021-05-02 23:29:26,524 INFO L194 CegarLoopUtils]: At program point L16-2(lines 16 19) the Hoare annotation is: (let ((.cse0 (not (= (let ((.cse3 (div main_~y~0 4294967296))) (let ((.cse2 (* .cse3 (- 4294967296)))) (let ((.cse1 (div (+ main_~y~0 .cse2) 3))) (+ (* (div (+ main_~y~0 (* .cse1 (- 3)) .cse2) 4294967296) 4294967296) (* .cse1 3) (* .cse3 4294967296))))) main_~y~0)))) (or (and (<= 4 main_~x~0) (<= main_~x~0 4) (<= (+ (* 357913941 main_~y~0) (* 1073741824 (div (+ (* main_~y~0 (- 357913941)) 1431655759) 1073741824))) 357913936)) (and (<= (+ (* 89478485 main_~y~0) (* 268435456 (div (+ (* main_~y~0 (- 89478485)) 357913939) 268435456))) 89478484) (<= 2 main_~x~0) (<= main_~x~0 2)) (and (<= main_~x~0 3) (<= 3 main_~x~0) (<= (* 536870912 (div (+ (* main_~y~0 178956971) 715827879) 536870912)) (+ (* 178956971 main_~y~0) 178956968))) (and (<= main_~x~0 5) (<= 5 main_~x~0) (<= (* 2147483648 (div (+ (* main_~y~0 715827883) 2863311519) 2147483648)) (+ (* 715827883 main_~y~0) 715827872))) (and (<= 1 main_~x~0) (<= (* 134217728 (div (+ (* main_~y~0 44739243) 178956969) 134217728)) (+ (* 44739243 main_~y~0) 44739242)) (<= main_~x~0 1) .cse0) (and (= main_~y~0 1) (= main_~x~0 0)) (and (<= (div main_~x~0 4294967296) 0) (<= 6 main_~x~0) .cse0))) [2021-05-02 23:29:26,524 INFO L194 CegarLoopUtils]: At program point L16-3(lines 16 19) the Hoare annotation is: (not (= (let ((.cse2 (div main_~y~0 4294967296))) (let ((.cse1 (* .cse2 (- 4294967296)))) (let ((.cse0 (div (+ main_~y~0 .cse1) 3))) (+ (* (div (+ main_~y~0 (* .cse0 (- 3)) .cse1) 4294967296) 4294967296) (* .cse0 3) (* .cse2 4294967296))))) main_~y~0)) [2021-05-02 23:29:26,525 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 12 22) the Hoare annotation is: true [2021-05-02 23:29:26,525 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2021-05-02 23:29:26,525 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: true [2021-05-02 23:29:26,525 INFO L194 CegarLoopUtils]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:29:26,525 INFO L194 CegarLoopUtils]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-02 23:29:26,525 INFO L201 CegarLoopUtils]: At program point L6-2(lines 5 10) the Hoare annotation is: true [2021-05-02 23:29:26,525 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-02 23:29:26,541 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.05 11:29:26 BoogieIcfgContainer [2021-05-02 23:29:26,541 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-02 23:29:26,542 INFO L168 Benchmark]: Toolchain (without parser) took 10591.11 ms. Allocated memory was 127.9 MB in the beginning and 273.7 MB in the end (delta: 145.8 MB). Free memory was 93.4 MB in the beginning and 245.8 MB in the end (delta: -152.4 MB). Peak memory consumption was 142.4 MB. Max. memory is 8.0 GB. [2021-05-02 23:29:26,542 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 127.9 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-02 23:29:26,543 INFO L168 Benchmark]: CACSL2BoogieTranslator took 232.22 ms. Allocated memory is still 127.9 MB. Free memory was 93.1 MB in the beginning and 83.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. [2021-05-02 23:29:26,543 INFO L168 Benchmark]: Boogie Preprocessor took 81.02 ms. Allocated memory was 127.9 MB in the beginning and 227.5 MB in the end (delta: 99.6 MB). Free memory was 83.9 MB in the beginning and 212.1 MB in the end (delta: -128.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 8.0 GB. [2021-05-02 23:29:26,544 INFO L168 Benchmark]: RCFGBuilder took 364.57 ms. Allocated memory is still 227.5 MB. Free memory was 212.1 MB in the beginning and 199.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-05-02 23:29:26,544 INFO L168 Benchmark]: TraceAbstraction took 9903.79 ms. Allocated memory was 227.5 MB in the beginning and 273.7 MB in the end (delta: 46.1 MB). Free memory was 198.5 MB in the beginning and 245.8 MB in the end (delta: -47.3 MB). Peak memory consumption was 148.2 MB. Max. memory is 8.0 GB. [2021-05-02 23:29:26,546 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.15 ms. Allocated memory is still 127.9 MB. Free memory is still 109.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 232.22 ms. Allocated memory is still 127.9 MB. Free memory was 93.1 MB in the beginning and 83.9 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.4 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 81.02 ms. Allocated memory was 127.9 MB in the beginning and 227.5 MB in the end (delta: 99.6 MB). Free memory was 83.9 MB in the beginning and 212.1 MB in the end (delta: -128.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 8.0 GB. * RCFGBuilder took 364.57 ms. Allocated memory is still 227.5 MB. Free memory was 212.1 MB in the beginning and 199.0 MB in the end (delta: 13.1 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9903.79 ms. Allocated memory was 227.5 MB in the beginning and 273.7 MB in the end (delta: 46.1 MB). Free memory was 198.5 MB in the beginning and 245.8 MB in the end (delta: -47.3 MB). Peak memory consumption was 148.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 6834.5ms, OverallIterations: 9, TraceHistogramMax: 7, EmptinessCheckTime: 14.7ms, AutomataDifference: 4499.1ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 3002.0ms, InitialAbstractionConstructionTime: 9.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 90 SDtfs, 55 SDslu, 161 SDs, 0 SdLazy, 328 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 843.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 110 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 4582.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=8, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 57.7ms AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 18 LocationsWithAnnotation, 66 PreInvPairs, 94 NumberOfFragments, 310 HoareAnnotationTreeSize, 66 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 92.2ms HoareSimplificationTime, 18 FomulaSimplificationsInter, 507 FormulaSimplificationTreeSizeReductionInter, 2894.9ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: (((((((4 <= x && x <= 4) && 357913941 * y + 1073741824 * ((y * -357913941 + 1431655759) / 1073741824) <= 357913936) || ((89478485 * y + 268435456 * ((y * -89478485 + 357913939) / 268435456) <= 89478484 && 2 <= x) && x <= 2)) || ((x <= 3 && 3 <= x) && 536870912 * ((y * 178956971 + 715827879) / 536870912) <= 178956971 * y + 178956968)) || ((x <= 5 && 5 <= x) && 2147483648 * ((y * 715827883 + 2863311519) / 2147483648) <= 715827883 * y + 715827872)) || (((1 <= x && 134217728 * ((y * 44739243 + 178956969) / 134217728) <= 44739243 * y + 44739242) && x <= 1) && !((y + (y + y / 4294967296 * -4294967296) / 3 * -3 + y / 4294967296 * -4294967296) / 4294967296 * 4294967296 + (y + y / 4294967296 * -4294967296) / 3 * 3 + y / 4294967296 * 4294967296 == y))) || (y == 1 && x == 0)) || ((x / 4294967296 <= 0 && 6 <= x) && !((y + (y + y / 4294967296 * -4294967296) / 3 * -3 + y / 4294967296 * -4294967296) / 4294967296 * 4294967296 + (y + y / 4294967296 * -4294967296) / 3 * 3 + y / 4294967296 * 4294967296 == y)) - ProcedureContractResult [Line: 12]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...