/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-crafted/simple_array_index_value_4.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 11:33:10,106 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:33:10,108 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:33:10,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:33:10,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:33:10,155 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:33:10,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:33:10,157 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:33:10,158 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:33:10,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:33:10,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:33:10,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:33:10,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:33:10,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:33:10,163 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:33:10,164 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:33:10,165 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:33:10,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:33:10,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:33:10,168 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:33:10,169 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:33:10,183 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:33:10,184 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:33:10,185 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:33:10,187 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:33:10,187 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:33:10,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:33:10,188 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:33:10,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:33:10,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:33:10,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:33:10,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:33:10,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:33:10,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:33:10,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:33:10,192 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:33:10,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:33:10,193 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:33:10,193 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:33:10,194 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:33:10,195 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:33:10,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2021-05-06 11:33:10,207 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:33:10,207 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:33:10,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:33:10,209 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:33:10,209 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:33:10,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:33:10,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:33:10,210 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:33:10,210 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:33:10,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:33:10,210 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:33:10,210 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:33:10,210 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:33:10,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:33:10,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:33:10,211 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:33:10,211 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:33:10,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:33:10,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:33:10,212 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:33:10,212 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:33:10,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:33:10,213 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:33:10,213 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-06 11:33:10,485 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:33:10,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:33:10,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:33:10,509 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:33:10,510 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:33:10,511 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2021-05-06 11:33:10,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc7fc290e/446c38b798384a46bc145424e70480ff/FLAG09a244e53 [2021-05-06 11:33:10,969 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:33:10,970 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i [2021-05-06 11:33:10,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc7fc290e/446c38b798384a46bc145424e70480ff/FLAG09a244e53 [2021-05-06 11:33:10,995 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc7fc290e/446c38b798384a46bc145424e70480ff [2021-05-06 11:33:10,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:33:10,999 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:33:11,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:11,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:33:11,005 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:33:11,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:10" (1/1) ... [2021-05-06 11:33:11,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62e563f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11, skipping insertion in model container [2021-05-06 11:33:11,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:10" (1/1) ... [2021-05-06 11:33:11,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:33:11,033 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:33:11,183 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-crafted/simple_array_index_value_4.i[919,932] [2021-05-06 11:33:11,210 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:11,216 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:33:11,266 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-crafted/simple_array_index_value_4.i[919,932] [2021-05-06 11:33:11,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:11,296 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:33:11,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11 WrapperNode [2021-05-06 11:33:11,297 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:11,298 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:33:11,298 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:33:11,298 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:33:11,307 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (1/1) ... [2021-05-06 11:33:11,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (1/1) ... [2021-05-06 11:33:11,319 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (1/1) ... [2021-05-06 11:33:11,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (1/1) ... [2021-05-06 11:33:11,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (1/1) ... [2021-05-06 11:33:11,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (1/1) ... [2021-05-06 11:33:11,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (1/1) ... [2021-05-06 11:33:11,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:33:11,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:33:11,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:33:11,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:33:11,346 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (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-06 11:33:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:33:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:33:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:33:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:33:11,415 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-06 11:33:11,416 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:33:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:33:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:33:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2021-05-06 11:33:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2021-05-06 11:33:11,416 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:33:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:33:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:33:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:33:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-06 11:33:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:33:11,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:33:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:33:11,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:33:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:33:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:33:11,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:33:11,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:33:11,666 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2021-05-06 11:33:11,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:11 BoogieIcfgContainer [2021-05-06 11:33:11,667 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:33:11,668 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:33:11,668 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:33:11,671 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:33:11,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:33:10" (1/3) ... [2021-05-06 11:33:11,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3922d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:11, skipping insertion in model container [2021-05-06 11:33:11,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:11" (2/3) ... [2021-05-06 11:33:11,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f3922d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:11, skipping insertion in model container [2021-05-06 11:33:11,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:11" (3/3) ... [2021-05-06 11:33:11,673 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i [2021-05-06 11:33:11,677 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:33:11,680 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-06 11:33:11,700 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-06 11:33:11,726 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:33:11,726 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:33:11,726 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:33:11,726 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:33:11,727 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:33:11,727 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:33:11,727 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:33:11,727 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:33:11,742 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-06 11:33:11,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 11:33:11,761 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:11,762 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:11,762 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:11,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:11,766 INFO L82 PathProgramCache]: Analyzing trace with hash -2103477690, now seen corresponding path program 1 times [2021-05-06 11:33:11,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:11,790 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [150289501] [2021-05-06 11:33:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:11,858 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,046 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,077 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 11:33:12,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,085 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:33:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-06 11:33:12,095 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:12,095 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [150289501] [2021-05-06 11:33:12,097 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [150289501] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:12,097 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:12,098 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-06 11:33:12,098 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73225573] [2021-05-06 11:33:12,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-06 11:33:12,101 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:12,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-06 11:33:12,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 11:33:12,115 INFO L87 Difference]: Start difference. First operand has 33 states, 20 states have (on average 1.4) internal successors, (28), 22 states have internal predecessors, (28), 7 states have call successors, (7), 4 states have call predecessors, (7), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 11:33:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:12,237 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2021-05-06 11:33:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-06 11:33:12,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2021-05-06 11:33:12,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:12,245 INFO L225 Difference]: With dead ends: 59 [2021-05-06 11:33:12,245 INFO L226 Difference]: Without dead ends: 28 [2021-05-06 11:33:12,248 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 40.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-06 11:33:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-05-06 11:33:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-05-06 11:33:12,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 11:33:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-05-06 11:33:12,291 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 22 [2021-05-06 11:33:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:12,292 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-05-06 11:33:12,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 11:33:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-05-06 11:33:12,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 11:33:12,293 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:12,293 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:12,294 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:33:12,294 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:12,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:12,294 INFO L82 PathProgramCache]: Analyzing trace with hash 371025730, now seen corresponding path program 1 times [2021-05-06 11:33:12,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:12,295 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1044477253] [2021-05-06 11:33:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:12,297 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,413 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:12,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,420 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 11:33:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,452 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:33:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-06 11:33:12,471 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:12,471 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1044477253] [2021-05-06 11:33:12,472 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1044477253] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:12,472 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:12,472 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 11:33:12,472 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079076678] [2021-05-06 11:33:12,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 11:33:12,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:12,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 11:33:12,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:12,476 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 11:33:12,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:12,791 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2021-05-06 11:33:12,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 11:33:12,792 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2021-05-06 11:33:12,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:12,793 INFO L225 Difference]: With dead ends: 43 [2021-05-06 11:33:12,793 INFO L226 Difference]: Without dead ends: 41 [2021-05-06 11:33:12,794 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 179.9ms TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2021-05-06 11:33:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2021-05-06 11:33:12,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 34. [2021-05-06 11:33:12,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-06 11:33:12,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2021-05-06 11:33:12,818 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 22 [2021-05-06 11:33:12,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:12,818 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2021-05-06 11:33:12,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 7 states have internal predecessors, (11), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 11:33:12,818 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2021-05-06 11:33:12,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-06 11:33:12,819 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:12,819 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:12,819 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:33:12,820 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:12,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:12,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1433932453, now seen corresponding path program 1 times [2021-05-06 11:33:12,820 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:12,820 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1419786150] [2021-05-06 11:33:12,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:12,822 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,885 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,894 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 11:33:12,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,900 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:33:12,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-05-06 11:33:12,904 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:12,904 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1419786150] [2021-05-06 11:33:12,904 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1419786150] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:12,904 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:12,905 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:12,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315506120] [2021-05-06 11:33:12,905 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:12,905 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:12,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:12,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:12,906 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 11:33:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:13,001 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2021-05-06 11:33:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:33:13,002 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-05-06 11:33:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:13,003 INFO L225 Difference]: With dead ends: 47 [2021-05-06 11:33:13,003 INFO L226 Difference]: Without dead ends: 37 [2021-05-06 11:33:13,003 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:13,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-06 11:33:13,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2021-05-06 11:33:13,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 22 states have internal predecessors, (23), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-06 11:33:13,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2021-05-06 11:33:13,011 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 24 [2021-05-06 11:33:13,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:13,011 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2021-05-06 11:33:13,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-06 11:33:13,012 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2021-05-06 11:33:13,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-05-06 11:33:13,013 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:13,013 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:13,013 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:33:13,013 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:13,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:13,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1366441036, now seen corresponding path program 1 times [2021-05-06 11:33:13,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:13,014 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [797637086] [2021-05-06 11:33:13,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:13,016 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:13,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:13,188 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:13,210 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 11:33:13,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:13,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:33:13,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:13,243 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:33:13,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:13,261 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 11:33:13,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:13,272 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-06 11:33:13,272 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:13,272 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [797637086] [2021-05-06 11:33:13,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [797637086] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:13,273 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:13,273 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-05-06 11:33:13,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260435132] [2021-05-06 11:33:13,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-05-06 11:33:13,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:13,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-05-06 11:33:13,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:33:13,275 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-05-06 11:33:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:13,615 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2021-05-06 11:33:13,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-05-06 11:33:13,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2021-05-06 11:33:13,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:13,618 INFO L225 Difference]: With dead ends: 49 [2021-05-06 11:33:13,618 INFO L226 Difference]: Without dead ends: 47 [2021-05-06 11:33:13,619 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 235.5ms TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2021-05-06 11:33:13,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2021-05-06 11:33:13,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 33. [2021-05-06 11:33:13,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-05-06 11:33:13,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2021-05-06 11:33:13,634 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 35 [2021-05-06 11:33:13,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:13,634 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2021-05-06 11:33:13,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2021-05-06 11:33:13,635 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2021-05-06 11:33:13,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-05-06 11:33:13,635 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:13,636 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:13,636 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:33:13,636 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:13,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:13,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1824318825, now seen corresponding path program 1 times [2021-05-06 11:33:13,637 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:13,637 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [692890327] [2021-05-06 11:33:13,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:13,640 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:14,189 WARN L205 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 73 [2021-05-06 11:33:14,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:14,333 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 11:33:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:14,367 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:33:14,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:14,381 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:33:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:14,388 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 11:33:14,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:14,408 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-06 11:33:14,408 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:14,408 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [692890327] [2021-05-06 11:33:14,409 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [692890327] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:14,409 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:14,409 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-05-06 11:33:14,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697798467] [2021-05-06 11:33:14,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-06 11:33:14,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:14,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-06 11:33:14,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2021-05-06 11:33:14,414 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 11:33:14,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:14,912 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2021-05-06 11:33:14,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-05-06 11:33:14,912 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 37 [2021-05-06 11:33:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:14,913 INFO L225 Difference]: With dead ends: 42 [2021-05-06 11:33:14,913 INFO L226 Difference]: Without dead ends: 40 [2021-05-06 11:33:14,914 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 704.5ms TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2021-05-06 11:33:14,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-06 11:33:14,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2021-05-06 11:33:14,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2021-05-06 11:33:14,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2021-05-06 11:33:14,921 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 37 [2021-05-06 11:33:14,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:14,921 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2021-05-06 11:33:14,921 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 10 states have internal predecessors, (19), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2021-05-06 11:33:14,922 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2021-05-06 11:33:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2021-05-06 11:33:14,922 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:14,923 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2021-05-06 11:33:14,923 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 11:33:14,923 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:14,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:14,923 INFO L82 PathProgramCache]: Analyzing trace with hash 583974312, now seen corresponding path program 1 times [2021-05-06 11:33:14,923 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:14,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1923231254] [2021-05-06 11:33:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:14,925 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:14,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:15,017 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:15,024 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-05-06 11:33:15,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:15,027 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-05-06 11:33:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:15,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2021-05-06 11:33:15,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:15,033 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2021-05-06 11:33:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:15,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-05-06 11:33:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-05-06 11:33:15,043 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:15,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1923231254] [2021-05-06 11:33:15,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1923231254] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:15,046 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:15,046 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-06 11:33:15,046 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663791112] [2021-05-06 11:33:15,046 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-06 11:33:15,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:15,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-06 11:33:15,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:15,047 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-06 11:33:15,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:15,161 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2021-05-06 11:33:15,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:15,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 44 [2021-05-06 11:33:15,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:15,163 INFO L225 Difference]: With dead ends: 45 [2021-05-06 11:33:15,163 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:33:15,164 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 60.5ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:15,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:33:15,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:33:15,164 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-06 11:33:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:33:15,165 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 44 [2021-05-06 11:33:15,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:15,165 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:33:15,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 4 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2021-05-06 11:33:15,165 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:33:15,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:33:15,166 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:33:15,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:33:15,848 INFO L198 CegarLoopUtils]: For program point L18-1(line 18) no Hoare annotation was computed. [2021-05-06 11:33:15,848 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 18) no Hoare annotation was computed. [2021-05-06 11:33:15,848 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 18) no Hoare annotation was computed. [2021-05-06 11:33:15,848 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:15,848 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#NULL.base| |old(#NULL.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|) (= |#t~string1.offset| |old(#t~string1.offset)|)) [2021-05-06 11:33:15,848 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:15,849 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:15,849 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:33:15,849 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:33:15,849 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:15,849 INFO L201 CegarLoopUtils]: At program point assume_abort_if_notENTRY(lines 20 22) the Hoare annotation is: true [2021-05-06 11:33:15,849 INFO L194 CegarLoopUtils]: At program point L21(line 21) the Hoare annotation is: (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) [2021-05-06 11:33:15,849 INFO L194 CegarLoopUtils]: At program point L21-2(lines 20 22) the Hoare annotation is: (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0))) [2021-05-06 11:33:15,849 INFO L194 CegarLoopUtils]: At program point assume_abort_if_notEXIT(lines 20 22) the Hoare annotation is: (and (= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|) (not (= |assume_abort_if_not_#in~cond| 0))) [2021-05-06 11:33:15,849 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 33 61) the Hoare annotation is: true [2021-05-06 11:33:15,849 INFO L194 CegarLoopUtils]: At program point L54-2(lines 54 58) the Hoare annotation is: (let ((.cse5 (div main_~index1~0 4294967296))) (let ((.cse4 (div main_~index2~0 4294967296)) (.cse0 (* 4294967296 .cse5))) (or (and (<= (+ .cse0 1) main_~index1~0) (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse2 (select .cse3 (+ (* .cse5 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse1 (select .cse3 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ .cse2 (* .cse1 (- 1)) 4294967295) 4294967296)))) .cse2))) (<= main_~index1~0 (+ .cse0 99999)) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse0 4294967294))) (<= (+ (* 4294967296 .cse4) main_~index1~0 1) (+ .cse0 main_~index2~0))))) [2021-05-06 11:33:15,850 INFO L194 CegarLoopUtils]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (or (<= main_~index2~0 (+ .cse0 99998)) (and (<= main_~index2~0 (+ .cse0 99999)) (= main_~loop_entered~0 0))) (<= (+ .cse0 main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0)))) [2021-05-06 11:33:15,850 INFO L194 CegarLoopUtils]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse0 99999)) (<= (+ .cse0 main_~index1~0 1) (+ (* 4294967296 (div main_~index1~0 4294967296)) main_~index2~0)))) [2021-05-06 11:33:15,850 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 33 61) the Hoare annotation is: true [2021-05-06 11:33:15,850 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 33 61) the Hoare annotation is: (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) [2021-05-06 11:33:15,850 INFO L194 CegarLoopUtils]: At program point L55(line 55) the Hoare annotation is: (let ((.cse5 (div main_~index1~0 4294967296)) (.cse4 (div main_~index2~0 4294967296))) (let ((.cse6 (* 4294967296 .cse4)) (.cse0 (* 4294967296 .cse5)) (.cse8 (* 4294967296 (div |main_#t~mem10| 4294967296))) (.cse7 (+ (* 4294967296 (div |main_#t~mem9| 4294967296)) |main_#t~mem10|))) (and (<= (+ .cse0 1) main_~index1~0) (or (let ((.cse3 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse2 (select .cse3 (+ (* .cse5 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse1 (select .cse3 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse1 (* 4294967296 (div (+ .cse2 (* .cse1 (- 1)) 4294967295) 4294967296)))) .cse2))) (<= (+ .cse6 main_~index1~0) (+ .cse0 main_~index2~0))) (<= main_~index1~0 (+ .cse0 99999)) (< .cse7 (+ |main_#t~mem9| .cse8 1)) (<= main_~index2~0 (+ .cse6 99999)) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse0 4294967294)) (<= (+ |main_#t~mem9| .cse8) .cse7)))) [2021-05-06 11:33:15,850 INFO L194 CegarLoopUtils]: At program point L55-1(line 55) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index1~0 4294967296)))) (and (<= (+ .cse0 1) main_~index1~0) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse0 4294967294)))) [2021-05-06 11:33:15,850 INFO L201 CegarLoopUtils]: At program point L53(lines 53 59) the Hoare annotation is: true [2021-05-06 11:33:15,851 INFO L194 CegarLoopUtils]: At program point L47(line 47) the Hoare annotation is: (let ((.cse2 (div main_~index2~0 4294967296))) (let ((.cse0 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (* 4294967296 .cse2)) (.cse1 (div main_~index1~0 4294967296))) (and (= (select .cse0 (+ (* .cse1 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)) |main_#t~mem5|) (= (select .cse0 (+ (* .cse2 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)) |main_#t~mem6|) (<= main_~index2~0 (+ .cse3 99999)) (<= (+ .cse3 main_~index1~0 1) (+ (* 4294967296 .cse1) main_~index2~0))))) [2021-05-06 11:33:15,851 INFO L194 CegarLoopUtils]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse4 (div main_~index2~0 4294967296)) (.cse5 (select |#memory_int| |main_~#array~0.base|)) (.cse3 (div main_~index1~0 4294967296))) (let ((.cse0 (select .cse5 (+ (* .cse3 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|))) (.cse1 (select .cse5 (+ (* .cse4 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|))) (.cse2 (* 4294967296 .cse4))) (and (= .cse0 |main_#t~mem5|) (= .cse1 |main_#t~mem6|) (<= main_~index2~0 (+ .cse2 99999)) (<= .cse1 (+ .cse0 (* 4294967296 (div (+ (* .cse0 (- 1)) .cse1) 4294967296)))) (<= (+ .cse2 main_~index1~0 1) (+ (* 4294967296 .cse3) main_~index2~0))))) [2021-05-06 11:33:15,851 INFO L194 CegarLoopUtils]: At program point L45-1(lines 43 51) the Hoare annotation is: (let ((.cse6 (div main_~index1~0 4294967296)) (.cse5 (div main_~index2~0 4294967296))) (let ((.cse1 (* 4294967296 .cse5)) (.cse0 (* 4294967296 .cse6))) (or (and (<= main_~index1~0 (+ .cse0 99999)) (<= main_~index2~0 (+ .cse1 99999)) (= main_~loop_entered~0 0)) (and (<= main_~index2~0 (+ .cse1 99998)) (<= (+ .cse0 1) main_~index1~0) (or (let ((.cse4 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse3 (select .cse4 (+ (* .cse6 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse2 (select .cse4 (+ (* .cse5 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse2 (* 4294967296 (div (+ .cse3 (* .cse2 (- 1)) 4294967295) 4294967296)))) .cse3))) (<= (+ .cse1 main_~index1~0) (+ .cse0 main_~index2~0))) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse0 4294967294)))))) [2021-05-06 11:33:15,851 INFO L194 CegarLoopUtils]: At program point L43(line 43) the Hoare annotation is: (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (= main_~loop_entered~0 0)) [2021-05-06 11:33:15,852 INFO L194 CegarLoopUtils]: At program point L45-2(lines 34 61) the Hoare annotation is: (or (let ((.cse6 (div main_~index1~0 4294967296)) (.cse5 (div main_~index2~0 4294967296))) (let ((.cse0 (* 4294967296 .cse5)) (.cse1 (* 4294967296 .cse6))) (and (<= main_~index2~0 (+ .cse0 99998)) (<= (+ .cse1 1) main_~index1~0) (or (let ((.cse4 (select |#memory_int| |main_~#array~0.base|))) (let ((.cse3 (select .cse4 (+ (* .cse6 (- 17179869184)) (* main_~index1~0 4) |main_~#array~0.offset|)))) (<= (let ((.cse2 (select .cse4 (+ (* .cse5 (- 17179869184)) (* main_~index2~0 4) |main_~#array~0.offset|)))) (+ .cse2 (* 4294967296 (div (+ .cse3 (* .cse2 (- 1)) 4294967295) 4294967296)))) .cse3))) (<= (+ .cse0 main_~index1~0) (+ .cse1 main_~index2~0))) (<= (+ (* 4294967296 (div (+ (* main_~index2~0 (- 1)) main_~index1~0 4294967294) 4294967296)) main_~index2~0) (+ .cse1 4294967294))))) (= main_~loop_entered~0 0)) [2021-05-06 11:33:15,852 INFO L194 CegarLoopUtils]: At program point L41(line 41) the Hoare annotation is: (= main_~loop_entered~0 0) [2021-05-06 11:33:15,852 INFO L194 CegarLoopUtils]: At program point L41-1(line 41) the Hoare annotation is: (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (= main_~loop_entered~0 0)) [2021-05-06 11:33:15,852 INFO L201 CegarLoopUtils]: At program point __VERIFIER_assertENTRY(lines 23 29) the Hoare annotation is: true [2021-05-06 11:33:15,852 INFO L194 CegarLoopUtils]: At program point L26(line 26) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:33:15,852 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertEXIT(lines 23 29) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:33:15,852 INFO L194 CegarLoopUtils]: At program point L25(lines 25 27) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:33:15,852 INFO L194 CegarLoopUtils]: At program point L25-2(lines 23 29) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2021-05-06 11:33:15,852 INFO L194 CegarLoopUtils]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2021-05-06 11:33:15,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:33:15 BoogieIcfgContainer [2021-05-06 11:33:15,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:33:15,884 INFO L168 Benchmark]: Toolchain (without parser) took 4884.35 ms. Allocated memory was 184.5 MB in the beginning and 222.3 MB in the end (delta: 37.7 MB). Free memory was 149.7 MB in the beginning and 178.3 MB in the end (delta: -28.6 MB). Peak memory consumption was 111.6 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:15,884 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 184.5 MB. Free memory is still 166.2 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:33:15,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 296.16 ms. Allocated memory is still 184.5 MB. Free memory was 149.5 MB in the beginning and 167.4 MB in the end (delta: -17.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:15,885 INFO L168 Benchmark]: Boogie Preprocessor took 46.46 ms. Allocated memory is still 184.5 MB. Free memory was 167.4 MB in the beginning and 166.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:15,885 INFO L168 Benchmark]: RCFGBuilder took 322.05 ms. Allocated memory is still 184.5 MB. Free memory was 165.6 MB in the beginning and 149.2 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:15,885 INFO L168 Benchmark]: TraceAbstraction took 4214.97 ms. Allocated memory was 184.5 MB in the beginning and 222.3 MB in the end (delta: 37.7 MB). Free memory was 148.8 MB in the beginning and 178.3 MB in the end (delta: -29.5 MB). Peak memory consumption was 110.2 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:15,886 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.13 ms. Allocated memory is still 184.5 MB. Free memory is still 166.2 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 296.16 ms. Allocated memory is still 184.5 MB. Free memory was 149.5 MB in the beginning and 167.4 MB in the end (delta: -17.9 MB). Peak memory consumption was 13.0 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 46.46 ms. Allocated memory is still 184.5 MB. Free memory was 167.4 MB in the beginning and 166.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 322.05 ms. Allocated memory is still 184.5 MB. Free memory was 165.6 MB in the beginning and 149.2 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 4214.97 ms. Allocated memory was 184.5 MB in the beginning and 222.3 MB in the end (delta: 37.7 MB). Free memory was 148.8 MB in the beginning and 178.3 MB in the end (delta: -29.5 MB). Peak memory consumption was 110.2 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 26]: 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 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3441.9ms, OverallIterations: 6, TraceHistogramMax: 3, EmptinessCheckTime: 27.3ms, AutomataDifference: 1528.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 681.1ms, InitialAbstractionConstructionTime: 11.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 152 SDtfs, 119 SDslu, 269 SDs, 0 SdLazy, 630 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 626.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 60 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1240.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=5, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 86.6ms AutomataMinimizationTime, 6 MinimizatonAttempts, 25 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 33 LocationsWithAnnotation, 89 PreInvPairs, 126 NumberOfFragments, 950 HoareAnnotationTreeSize, 89 FomulaSimplifications, 54 FormulaSimplificationTreeSizeReduction, 130.9ms HoareSimplificationTime, 33 FomulaSimplificationsInter, 1060 FormulaSimplificationTreeSizeReductionInter, 535.5ms 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: 43]: Loop Invariant Derived loop invariant: ((index1 <= 4294967296 * (index1 / 4294967296) + 99999 && index2 <= 4294967296 * (index2 / 4294967296) + 99999) && loop_entered == 0) || (((index2 <= 4294967296 * (index2 / 4294967296) + 99998 && 4294967296 * (index1 / 4294967296) + 1 <= index1) && (unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] + 4294967296 * ((unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] + unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] || 4294967296 * (index2 / 4294967296) + index1 <= 4294967296 * (index1 / 4294967296) + index2)) && 4294967296 * ((index2 * -1 + index1 + 4294967294) / 4294967296) + index2 <= 4294967296 * (index1 / 4294967296) + 4294967294) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((4294967296 * (index1 / 4294967296) + 1 <= index1 && unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] + 4294967296 * ((unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array] + unknown-#memory_int-unknown[array][index2 / 4294967296 * -17179869184 + index2 * 4 + array] * -1 + 4294967295) / 4294967296) <= unknown-#memory_int-unknown[array][index1 / 4294967296 * -17179869184 + index1 * 4 + array]) && index1 <= 4294967296 * (index1 / 4294967296) + 99999) && 4294967296 * ((index2 * -1 + index1 + 4294967294) / 4294967296) + index2 <= 4294967296 * (index1 / 4294967296) + 4294967294) || 4294967296 * (index2 / 4294967296) + index1 + 1 <= 4294967296 * (index1 / 4294967296) + index2 - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: cond == \old(cond) && !(\old(cond) == 0) - ProcedureContractResult [Line: 33]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 23]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! Received shutdown request...