/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.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-6253b08 [2021-05-06 11:33:05,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-06 11:33:05,012 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-06 11:33:05,048 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-06 11:33:05,048 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-06 11:33:05,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-06 11:33:05,066 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-06 11:33:05,071 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-06 11:33:05,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-06 11:33:05,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-06 11:33:05,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-06 11:33:05,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-06 11:33:05,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-06 11:33:05,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-06 11:33:05,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-06 11:33:05,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-06 11:33:05,088 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-06 11:33:05,089 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-06 11:33:05,091 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-06 11:33:05,096 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-06 11:33:05,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-06 11:33:05,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-06 11:33:05,099 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-06 11:33:05,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-06 11:33:05,107 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-06 11:33:05,107 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-06 11:33:05,107 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-06 11:33:05,109 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-06 11:33:05,109 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-06 11:33:05,110 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-06 11:33:05,110 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-06 11:33:05,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-06 11:33:05,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-06 11:33:05,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-06 11:33:05,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-06 11:33:05,114 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-06 11:33:05,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-06 11:33:05,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-06 11:33:05,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-06 11:33:05,125 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-06 11:33:05,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-06 11:33:05,144 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:05,160 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-06 11:33:05,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-06 11:33:05,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-06 11:33:05,163 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-06 11:33:05,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-06 11:33:05,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-06 11:33:05,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-06 11:33:05,163 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-06 11:33:05,163 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-06 11:33:05,163 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-06 11:33:05,164 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-06 11:33:05,164 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-06 11:33:05,164 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-06 11:33:05,165 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-06 11:33:05,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-06 11:33:05,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-06 11:33:05,165 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-05-06 11:33:05,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-06 11:33:05,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-06 11:33:05,166 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-06 11:33:05,166 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2021-05-06 11:33:05,166 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-06 11:33:05,166 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2021-05-06 11:33:05,166 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:05,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-06 11:33:05,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-06 11:33:05,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-06 11:33:05,498 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-06 11:33:05,499 INFO L275 PluginConnector]: CDTParser initialized [2021-05-06 11:33:05,499 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.v+nlh-reducer.c [2021-05-06 11:33:05,554 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63718aed/e71f96bee05149ecb003f64a7e0b80cb/FLAG5ca694271 [2021-05-06 11:33:05,933 INFO L306 CDTParser]: Found 1 translation units. [2021-05-06 11:33:05,933 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2021-05-06 11:33:05,942 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63718aed/e71f96bee05149ecb003f64a7e0b80cb/FLAG5ca694271 [2021-05-06 11:33:05,957 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a63718aed/e71f96bee05149ecb003f64a7e0b80cb [2021-05-06 11:33:05,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-06 11:33:05,962 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-06 11:33:05,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:05,965 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-06 11:33:05,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-06 11:33:05,969 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:05" (1/1) ... [2021-05-06 11:33:05,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ebe6bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:05, skipping insertion in model container [2021-05-06 11:33:05,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.05 11:33:05" (1/1) ... [2021-05-06 11:33:05,975 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-06 11:33:05,995 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-06 11:33:06,148 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.v+nlh-reducer.c[1126,1139] [2021-05-06 11:33:06,165 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.v+nlh-reducer.c[1880,1893] [2021-05-06 11:33:06,171 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.v+nlh-reducer.c[2415,2428] [2021-05-06 11:33:06,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:06,210 INFO L203 MainTranslator]: Completed pre-run [2021-05-06 11:33:06,248 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.v+nlh-reducer.c[1126,1139] [2021-05-06 11:33:06,260 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.v+nlh-reducer.c[1880,1893] [2021-05-06 11:33:06,265 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.v+nlh-reducer.c[2415,2428] [2021-05-06 11:33:06,267 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-06 11:33:06,279 INFO L208 MainTranslator]: Completed translation [2021-05-06 11:33:06,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:06 WrapperNode [2021-05-06 11:33:06,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-06 11:33:06,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-06 11:33:06,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-06 11:33:06,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-06 11:33:06,292 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:06" (1/1) ... [2021-05-06 11:33:06,292 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:06" (1/1) ... [2021-05-06 11:33:06,304 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:06" (1/1) ... [2021-05-06 11:33:06,305 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:06" (1/1) ... [2021-05-06 11:33:06,318 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:06" (1/1) ... [2021-05-06 11:33:06,321 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:06" (1/1) ... [2021-05-06 11:33:06,322 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:06" (1/1) ... [2021-05-06 11:33:06,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-06 11:33:06,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-06 11:33:06,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-06 11:33:06,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-06 11:33:06,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:06" (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:06,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-06 11:33:06,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-06 11:33:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-06 11:33:06,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-05-06 11:33:06,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-06 11:33:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-06 11:33:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-06 11:33:06,403 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-06 11:33:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-06 11:33:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-05-06 11:33:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-06 11:33:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-06 11:33:06,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-06 11:33:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-06 11:33:06,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-06 11:33:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-06 11:33:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-06 11:33:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-06 11:33:06,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-06 11:33:06,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-06 11:33:06,769 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-05-06 11:33:06,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:06 BoogieIcfgContainer [2021-05-06 11:33:06,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-06 11:33:06,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-06 11:33:06,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-06 11:33:06,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-06 11:33:06,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.05 11:33:05" (1/3) ... [2021-05-06 11:33:06,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e4fdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:06, skipping insertion in model container [2021-05-06 11:33:06,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.05 11:33:06" (2/3) ... [2021-05-06 11:33:06,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60e4fdff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.05 11:33:06, skipping insertion in model container [2021-05-06 11:33:06,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.05 11:33:06" (3/3) ... [2021-05-06 11:33:06,775 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2021-05-06 11:33:06,780 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2021-05-06 11:33:06,783 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-05-06 11:33:06,798 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-05-06 11:33:06,814 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-06 11:33:06,814 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-06 11:33:06,814 INFO L378 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2021-05-06 11:33:06,814 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-06 11:33:06,814 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-06 11:33:06,814 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-06 11:33:06,814 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-06 11:33:06,814 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-06 11:33:06,845 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-06 11:33:06,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-05-06 11:33:06,850 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:06,851 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:06,851 INFO L428 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:06,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:06,856 INFO L82 PathProgramCache]: Analyzing trace with hash 613221753, now seen corresponding path program 1 times [2021-05-06 11:33:06,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:06,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [79432368] [2021-05-06 11:33:06,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:06,913 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:07,178 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:07,208 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-06 11:33:07,209 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:07,210 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [79432368] [2021-05-06 11:33:07,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [79432368] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:07,212 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:07,212 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:07,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110650510] [2021-05-06 11:33:07,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:07,216 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:07,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:07,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:07,227 INFO L87 Difference]: Start difference. First operand has 36 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 31 states have internal predecessors, (45), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:07,373 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2021-05-06 11:33:07,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:33:07,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2021-05-06 11:33:07,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:07,382 INFO L225 Difference]: With dead ends: 51 [2021-05-06 11:33:07,382 INFO L226 Difference]: Without dead ends: 33 [2021-05-06 11:33:07,384 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 72.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:07,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-06 11:33:07,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2021-05-06 11:33:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 25 states have (on average 1.32) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2021-05-06 11:33:07,424 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2021-05-06 11:33:07,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:07,425 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2021-05-06 11:33:07,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,425 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2021-05-06 11:33:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:33:07,425 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:07,425 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:07,426 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-06 11:33:07,426 INFO L428 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:07,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:07,427 INFO L82 PathProgramCache]: Analyzing trace with hash -274269075, now seen corresponding path program 1 times [2021-05-06 11:33:07,427 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:07,427 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [719332797] [2021-05-06 11:33:07,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:07,441 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:07,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:07,538 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:07,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:07,565 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-06 11:33:07,565 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:07,566 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [719332797] [2021-05-06 11:33:07,566 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [719332797] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:07,566 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:07,566 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-06 11:33:07,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433234854] [2021-05-06 11:33:07,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-06 11:33:07,567 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:07,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-06 11:33:07,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-05-06 11:33:07,569 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:07,672 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2021-05-06 11:33:07,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-06 11:33:07,672 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-06 11:33:07,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:07,673 INFO L225 Difference]: With dead ends: 51 [2021-05-06 11:33:07,673 INFO L226 Difference]: Without dead ends: 49 [2021-05-06 11:33:07,674 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-05-06 11:33:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2021-05-06 11:33:07,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2021-05-06 11:33:07,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2021-05-06 11:33:07,681 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2021-05-06 11:33:07,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:07,681 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2021-05-06 11:33:07,682 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,682 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2021-05-06 11:33:07,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-05-06 11:33:07,682 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:07,682 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:07,682 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-06 11:33:07,683 INFO L428 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:07,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:07,683 INFO L82 PathProgramCache]: Analyzing trace with hash -210546126, now seen corresponding path program 1 times [2021-05-06 11:33:07,683 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:07,684 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1618316943] [2021-05-06 11:33:07,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:07,685 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:07,737 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:07,743 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-06 11:33:07,744 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:07,744 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1618316943] [2021-05-06 11:33:07,744 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1618316943] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:07,744 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:07,744 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:07,745 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739198035] [2021-05-06 11:33:07,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:07,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:07,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:07,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:07,746 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:07,817 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2021-05-06 11:33:07,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:33:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2021-05-06 11:33:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:07,818 INFO L225 Difference]: With dead ends: 60 [2021-05-06 11:33:07,819 INFO L226 Difference]: Without dead ends: 40 [2021-05-06 11:33:07,819 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.5ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-06 11:33:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2021-05-06 11:33:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2021-05-06 11:33:07,825 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2021-05-06 11:33:07,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:07,826 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2021-05-06 11:33:07,826 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,826 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2021-05-06 11:33:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-05-06 11:33:07,826 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:07,826 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-06 11:33:07,827 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-06 11:33:07,827 INFO L428 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash 144789104, now seen corresponding path program 1 times [2021-05-06 11:33:07,827 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:07,828 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [804453529] [2021-05-06 11:33:07,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:07,829 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:07,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:07,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:07,883 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-06 11:33:07,883 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:07,883 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [804453529] [2021-05-06 11:33:07,884 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [804453529] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:07,884 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:07,884 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-06 11:33:07,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233943398] [2021-05-06 11:33:07,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-06 11:33:07,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:07,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-06 11:33:07,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:07,885 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:07,967 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2021-05-06 11:33:07,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-06 11:33:07,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2021-05-06 11:33:07,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:07,970 INFO L225 Difference]: With dead ends: 54 [2021-05-06 11:33:07,970 INFO L226 Difference]: Without dead ends: 34 [2021-05-06 11:33:07,971 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.3ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-06 11:33:07,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2021-05-06 11:33:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2021-05-06 11:33:07,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2021-05-06 11:33:07,983 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2021-05-06 11:33:07,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:07,984 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2021-05-06 11:33:07,984 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:07,984 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2021-05-06 11:33:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-06 11:33:07,985 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:07,985 INFO L523 BasicCegarLoop]: trace histogram [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:07,986 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-06 11:33:07,986 INFO L428 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:07,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:07,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1825758388, now seen corresponding path program 1 times [2021-05-06 11:33:07,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:07,987 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1468800798] [2021-05-06 11:33:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:07,989 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:08,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:08,496 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:08,504 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-06 11:33:08,505 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:08,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1468800798] [2021-05-06 11:33:08,505 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1468800798] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:08,505 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:08,505 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-05-06 11:33:08,505 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680059047] [2021-05-06 11:33:08,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-06 11:33:08,506 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:08,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-06 11:33:08,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-05-06 11:33:08,507 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:08,674 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2021-05-06 11:33:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-05-06 11:33:08,675 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2021-05-06 11:33:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:08,676 INFO L225 Difference]: With dead ends: 44 [2021-05-06 11:33:08,676 INFO L226 Difference]: Without dead ends: 29 [2021-05-06 11:33:08,677 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 255.8ms TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:33:08,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-06 11:33:08,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-06 11:33:08,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 25 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:08,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-05-06 11:33:08,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2021-05-06 11:33:08,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:08,690 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-05-06 11:33:08,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:08,691 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-05-06 11:33:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-05-06 11:33:08,692 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:08,692 INFO L523 BasicCegarLoop]: trace histogram [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:08,692 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-05-06 11:33:08,692 INFO L428 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1415757154, now seen corresponding path program 1 times [2021-05-06 11:33:08,693 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:08,695 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1715919281] [2021-05-06 11:33:08,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:08,698 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:08,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:08,800 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-06 11:33:08,800 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:08,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1715919281] [2021-05-06 11:33:08,801 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1715919281] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:08,801 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:08,801 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:08,801 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405941949] [2021-05-06 11:33:08,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:08,801 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:08,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:08,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:08,802 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:08,922 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2021-05-06 11:33:08,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-06 11:33:08,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2021-05-06 11:33:08,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:08,924 INFO L225 Difference]: With dead ends: 42 [2021-05-06 11:33:08,924 INFO L226 Difference]: Without dead ends: 40 [2021-05-06 11:33:08,926 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 93.0ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-05-06 11:33:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-05-06 11:33:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2021-05-06 11:33:08,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.0869565217391304) internal successors, (25), 23 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:08,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2021-05-06 11:33:08,934 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2021-05-06 11:33:08,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:08,934 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2021-05-06 11:33:08,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:08,934 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2021-05-06 11:33:08,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-05-06 11:33:08,935 INFO L515 BasicCegarLoop]: Found error trace [2021-05-06 11:33:08,935 INFO L523 BasicCegarLoop]: trace histogram [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:08,935 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-05-06 11:33:08,935 INFO L428 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-06 11:33:08,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-06 11:33:08,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2087901094, now seen corresponding path program 1 times [2021-05-06 11:33:08,936 INFO L162 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2021-05-06 11:33:08,936 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1994098795] [2021-05-06 11:33:08,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-06 11:33:08,957 INFO L73 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2021-05-06 11:33:08,957 WARN L75 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2021-05-06 11:33:08,959 INFO L224 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2021-05-06 11:33:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:09,153 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-06 11:33:09,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-06 11:33:09,158 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-06 11:33:09,158 INFO L179 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2021-05-06 11:33:09,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1994098795] [2021-05-06 11:33:09,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModulePreferences [1994098795] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-06 11:33:09,161 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-06 11:33:09,161 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-06 11:33:09,161 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37737622] [2021-05-06 11:33:09,161 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-06 11:33:09,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2021-05-06 11:33:09,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-06 11:33:09,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-05-06 11:33:09,162 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:09,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-06 11:33:09,533 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2021-05-06 11:33:09,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-06 11:33:09,534 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2021-05-06 11:33:09,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-06 11:33:09,534 INFO L225 Difference]: With dead ends: 30 [2021-05-06 11:33:09,534 INFO L226 Difference]: Without dead ends: 0 [2021-05-06 11:33:09,535 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 115.4ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-05-06 11:33:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-05-06 11:33:09,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-05-06 11:33:09,535 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:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-05-06 11:33:09,535 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2021-05-06 11:33:09,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-06 11:33:09,536 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-05-06 11:33:09,536 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2021-05-06 11:33:09,536 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-05-06 11:33:09,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-05-06 11:33:09,536 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-05-06 11:33:09,538 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-05-06 11:33:10,267 WARN L205 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2021-05-06 11:33:10,397 INFO L198 CegarLoopUtils]: For program point reach_errorEXIT(line 4) no Hoare annotation was computed. [2021-05-06 11:33:10,397 INFO L198 CegarLoopUtils]: For program point reach_errorENTRY(line 4) no Hoare annotation was computed. [2021-05-06 11:33:10,397 INFO L198 CegarLoopUtils]: For program point reach_errorFINAL(line 4) no Hoare annotation was computed. [2021-05-06 11:33:10,397 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:10,397 INFO L194 CegarLoopUtils]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#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.offset| |old(#t~string4.offset)|) (= ~__return_136~0 |old(~__return_136~0)|) (= |old(#valid)| |#valid|) (= |#t~string5.base| |old(#t~string5.base)|) (= |#t~string4.base| |old(#t~string4.base)|) (= ~__return_main~0 |old(~__return_main~0)|) (= |#NULL.base| |old(#NULL.base)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2021-05-06 11:33:10,397 INFO L201 CegarLoopUtils]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:10,397 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2021-05-06 11:33:10,398 INFO L201 CegarLoopUtils]: At program point L-1(line -1) the Hoare annotation is: true [2021-05-06 11:33:10,398 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2021-05-06 11:33:10,398 INFO L201 CegarLoopUtils]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2021-05-06 11:33:10,398 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notENTRY(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:10,398 INFO L198 CegarLoopUtils]: For program point L7(line 7) no Hoare annotation was computed. [2021-05-06 11:33:10,398 INFO L198 CegarLoopUtils]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:10,398 INFO L198 CegarLoopUtils]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2021-05-06 11:33:10,398 INFO L194 CegarLoopUtils]: At program point L31(lines 31 147) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-06 11:33:10,398 INFO L194 CegarLoopUtils]: At program point L60(lines 60 93) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-05-06 11:33:10,398 INFO L201 CegarLoopUtils]: At program point mainEXIT(lines 14 168) the Hoare annotation is: true [2021-05-06 11:33:10,398 INFO L194 CegarLoopUtils]: At program point L151(lines 29 152) the Hoare annotation is: false [2021-05-06 11:33:10,399 INFO L194 CegarLoopUtils]: At program point L110(line 110) the Hoare annotation is: false [2021-05-06 11:33:10,399 INFO L194 CegarLoopUtils]: At program point L73(line 73) the Hoare annotation is: false [2021-05-06 11:33:10,399 INFO L194 CegarLoopUtils]: At program point L40(lines 40 139) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~__VERIFIER_assert__cond~0 1) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-06 11:33:10,399 INFO L201 CegarLoopUtils]: At program point L131(lines 98 132) the Hoare annotation is: true [2021-05-06 11:33:10,399 INFO L194 CegarLoopUtils]: At program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 110) the Hoare annotation is: false [2021-05-06 11:33:10,399 INFO L194 CegarLoopUtils]: At program point L156(lines 26 157) the Hoare annotation is: (or (and (let ((.cse0 (div main_~main__index2~0 4294967296)) (.cse1 (div main_~main__index1~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1)))))))) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1))) (= main_~main__loop_entered~0 0)) [2021-05-06 11:33:10,399 INFO L194 CegarLoopUtils]: At program point L57(lines 57 133) the Hoare annotation is: (and (let ((.cse0 (div main_~main__index2~0 4294967296)) (.cse1 (div main_~main__index1~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1)))))))) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1))) [2021-05-06 11:33:10,400 INFO L194 CegarLoopUtils]: At program point L24(lines 24 162) the Hoare annotation is: (and (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) (= main_~main__loop_entered~0 0)) [2021-05-06 11:33:10,400 INFO L194 CegarLoopUtils]: At program point L119(lines 99 128) the Hoare annotation is: (let ((.cse8 (div main_~main__index1~0 4294967296)) (.cse7 (div main_~main__index2~0 4294967296))) (let ((.cse9 (= main_~__VERIFIER_assert__cond~0 1)) (.cse0 (* 4294967296 .cse7)) (.cse1 (+ main_~main__index2~0 (* 4294967296 .cse8)))) (or (and (or (<= (+ main_~main__index1~0 .cse0) .cse1) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse8 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse7 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1))))))) .cse9 (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (not (= main_~__VERIFIER_assert__cond~2 0)) .cse9 (<= (+ main_~main__index1~0 .cse0 1) .cse1))))) [2021-05-06 11:33:10,400 INFO L194 CegarLoopUtils]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 73) the Hoare annotation is: false [2021-05-06 11:33:10,400 INFO L194 CegarLoopUtils]: At program point L62(lines 62 88) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-05-06 11:33:10,400 INFO L194 CegarLoopUtils]: At program point L29(lines 29 152) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-06 11:33:10,400 INFO L194 CegarLoopUtils]: At program point L87(lines 62 88) the Hoare annotation is: (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-05-06 11:33:10,401 INFO L194 CegarLoopUtils]: At program point L21(lines 21 167) the Hoare annotation is: (= main_~main__loop_entered~0 0) [2021-05-06 11:33:10,401 INFO L194 CegarLoopUtils]: At program point L50(lines 50 138) the Hoare annotation is: (let ((.cse3 (div main_~main__index2~0 4294967296))) (let ((.cse1 (select |#memory_int| |main_~#main__array~0.base|)) (.cse0 (* 4294967296 .cse3)) (.cse2 (div main_~main__index1~0 4294967296))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= (select .cse1 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse2 (- 17179869184)))) |main_#t~mem9|) (= main_~__VERIFIER_assert__cond~0 1) (= |main_#t~mem10| (select .cse1 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse3 (- 17179869184))))) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 .cse2)))))) [2021-05-06 11:33:10,401 INFO L194 CegarLoopUtils]: At program point L79(lines 46 139) the Hoare annotation is: (let ((.cse2 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (let ((.cse0 (<= main_~main__index2~0 (+ .cse2 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1))) (or (and (not (= main_~main____CPAchecker_TMP_0~1 0)) .cse0 .cse1 (not (= main_~__VERIFIER_assert__cond~1 0))) (and .cse0 .cse1 (= main_~main____CPAchecker_TMP_0~0 1)))) (<= (+ main_~main__index1~0 .cse2 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-06 11:33:10,401 INFO L201 CegarLoopUtils]: At program point mainFINAL(lines 14 168) the Hoare annotation is: true [2021-05-06 11:33:10,401 INFO L194 CegarLoopUtils]: At program point L108(lines 108 120) the Hoare annotation is: (and (let ((.cse0 (div main_~main__index2~0 4294967296)) (.cse1 (div main_~main__index1~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ main_~main__index2~0 (* 4294967296 .cse1))) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse5 (select .cse6 (+ (* main_~main__index1~0 4) |main_~#main__array~0.offset| (* .cse1 (- 17179869184))))) (.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184)))))) (let ((.cse4 (+ .cse5 (* 4294967296 (div .cse3 4294967296)))) (.cse2 (* 4294967296 (div .cse5 4294967296)))) (and (<= (+ .cse2 .cse3) .cse4) (< .cse4 (+ .cse2 .cse3 1)))))))) (not (= main_~__VERIFIER_assert__cond~2 0)) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1))) [2021-05-06 11:33:10,401 INFO L194 CegarLoopUtils]: At program point L42(line 42) the Hoare annotation is: false [2021-05-06 11:33:10,401 INFO L194 CegarLoopUtils]: At program point L71(lines 71 80) the Hoare annotation is: (and (not (= main_~main____CPAchecker_TMP_0~1 0)) (= main_~__VERIFIER_assert__cond~0 1) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* main_~main__index2~0 (- 1)) (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) 99998) 4294967296)) main_~main__index2~0 1)) (not (= main_~__VERIFIER_assert__cond~1 0)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296))))) [2021-05-06 11:33:10,402 INFO L194 CegarLoopUtils]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 42) the Hoare annotation is: false [2021-05-06 11:33:10,402 INFO L194 CegarLoopUtils]: At program point mainENTRY(lines 14 168) the Hoare annotation is: (and (= |old(#length)| |#length|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |old(#valid)| |#valid|)) [2021-05-06 11:33:10,402 INFO L194 CegarLoopUtils]: At program point L92(lines 60 93) the Hoare annotation is: false [2021-05-06 11:33:10,402 INFO L194 CegarLoopUtils]: At program point L26(lines 26 157) the Hoare annotation is: (and (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99999)) (<= main_~main__index1~0 (+ (* 4294967296 (div main_~main__index1~0 4294967296)) 99999)) (= main_~main__loop_entered~0 0)) [2021-05-06 11:33:10,402 INFO L194 CegarLoopUtils]: At program point L146(lines 31 147) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (= main_~main____CPAchecker_TMP_0~0 1) (<= (+ main_~main__index1~0 .cse0 1) (+ main_~main__index2~0 (* 4294967296 (div main_~main__index1~0 4294967296)))))) [2021-05-06 11:33:10,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.05 11:33:10 BoogieIcfgContainer [2021-05-06 11:33:10,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-05-06 11:33:10,425 INFO L168 Benchmark]: Toolchain (without parser) took 4463.74 ms. Allocated memory was 176.2 MB in the beginning and 211.8 MB in the end (delta: 35.7 MB). Free memory was 141.9 MB in the beginning and 174.5 MB in the end (delta: -32.6 MB). Peak memory consumption was 106.0 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:10,426 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 176.2 MB. Free memory is still 158.5 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-05-06 11:33:10,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 315.89 ms. Allocated memory is still 176.2 MB. Free memory was 141.7 MB in the beginning and 158.2 MB in the end (delta: -16.5 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:10,426 INFO L168 Benchmark]: Boogie Preprocessor took 41.91 ms. Allocated memory is still 176.2 MB. Free memory was 158.2 MB in the beginning and 156.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:10,427 INFO L168 Benchmark]: RCFGBuilder took 446.06 ms. Allocated memory is still 176.2 MB. Free memory was 156.7 MB in the beginning and 137.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:10,427 INFO L168 Benchmark]: TraceAbstraction took 3653.48 ms. Allocated memory was 176.2 MB in the beginning and 211.8 MB in the end (delta: 35.7 MB). Free memory was 136.7 MB in the beginning and 174.5 MB in the end (delta: -37.8 MB). Peak memory consumption was 100.6 MB. Max. memory is 8.0 GB. [2021-05-06 11:33:10,429 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.16 ms. Allocated memory is still 176.2 MB. Free memory is still 158.5 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 315.89 ms. Allocated memory is still 176.2 MB. Free memory was 141.7 MB in the beginning and 158.2 MB in the end (delta: -16.5 MB). Peak memory consumption was 11.7 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.91 ms. Allocated memory is still 176.2 MB. Free memory was 158.2 MB in the beginning and 156.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 446.06 ms. Allocated memory is still 176.2 MB. Free memory was 156.7 MB in the beginning and 137.3 MB in the end (delta: 19.4 MB). Peak memory consumption was 18.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 3653.48 ms. Allocated memory was 176.2 MB in the beginning and 211.8 MB in the end (delta: 35.7 MB). Free memory was 136.7 MB in the beginning and 174.5 MB in the end (delta: -37.8 MB). Peak memory consumption was 100.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 42]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 110]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 73]: 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, 43 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2724.9ms, OverallIterations: 7, TraceHistogramMax: 2, EmptinessCheckTime: 12.3ms, AutomataDifference: 1103.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 859.9ms, InitialAbstractionConstructionTime: 27.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 188 SDtfs, 176 SDslu, 241 SDs, 0 SdLazy, 373 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 665.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 649.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 73.0ms AutomataMinimizationTime, 7 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 36 LocationsWithAnnotation, 36 PreInvPairs, 60 NumberOfFragments, 1272 HoareAnnotationTreeSize, 36 FomulaSimplifications, 1263 FormulaSimplificationTreeSizeReduction, 43.1ms HoareSimplificationTime, 36 FomulaSimplificationsInter, 260 FormulaSimplificationTreeSizeReductionInter, 805.7ms 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 3 specifications checked. All of them hold - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296) || (4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] <= unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 1)) && __VERIFIER_assert__cond == 1) && main__index1 <= 4294967296 * ((main__index2 * -1 + (main__index1 + -1) / 4294967296 * 4294967296 + 99998) / 4294967296) + main__index2 + 1) || main__loop_entered == 0 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 99]: Loop Invariant Derived loop invariant: (((main__index1 + 4294967296 * (main__index2 / 4294967296) <= main__index2 + 4294967296 * (main__index1 / 4294967296) || (4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] <= unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) && unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 * 4 + main__array + main__index1 / 4294967296 * -17179869184] / 4294967296) + unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 1)) && __VERIFIER_assert__cond == 1) && main__index1 <= 4294967296 * ((main__index2 * -1 + (main__index1 + -1) / 4294967296 * 4294967296 + 99998) / 4294967296) + main__index2 + 1) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && !(__VERIFIER_assert__cond == 0)) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296)) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((!(main____CPAchecker_TMP_0 == 0) && __VERIFIER_assert__cond == 1) && main__index1 <= 4294967296 * ((main__index2 * -1 + (main__index1 + -1) / 4294967296 * 4294967296 + 99998) / 4294967296) + main__index2 + 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: ((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && main__loop_entered == 0) && main____CPAchecker_TMP_0 == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) - InvariantResult [Line: 98]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((!(main____CPAchecker_TMP_0 == 0) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) || ((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && main____CPAchecker_TMP_0 == 1)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= main__index2 + 4294967296 * (main__index1 / 4294967296) - ProcedureContractResult [Line: 14]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! Received shutdown request...