./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 22:14:00,110 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 22:14:00,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 22:14:00,176 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 22:14:00,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 22:14:00,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 22:14:00,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 22:14:00,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 22:14:00,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 22:14:00,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 22:14:00,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 22:14:00,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 22:14:00,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 22:14:00,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 22:14:00,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 22:14:00,199 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 22:14:00,200 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 22:14:00,202 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 22:14:00,203 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 22:14:00,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 22:14:00,210 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 22:14:00,212 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 22:14:00,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 22:14:00,213 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 22:14:00,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 22:14:00,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 22:14:00,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 22:14:00,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 22:14:00,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 22:14:00,220 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 22:14:00,221 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 22:14:00,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 22:14:00,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 22:14:00,223 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 22:14:00,224 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 22:14:00,225 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 22:14:00,225 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 22:14:00,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 22:14:00,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 22:14:00,226 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 22:14:00,227 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 22:14:00,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 22:14:00,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-19 22:14:00,258 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 22:14:00,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 22:14:00,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 22:14:00,259 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 22:14:00,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 22:14:00,260 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 22:14:00,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 22:14:00,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 22:14:00,261 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 22:14:00,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 22:14:00,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 22:14:00,262 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 22:14:00,262 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 22:14:00,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 22:14:00,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 22:14:00,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 22:14:00,263 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 22:14:00,263 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 22:14:00,263 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 22:14:00,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 22:14:00,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 22:14:00,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:14:00,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 22:14:00,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 22:14:00,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 22:14:00,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 22:14:00,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 22:14:00,266 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 22:14:00,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 22:14:00,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 22:14:00,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0aec0bb8b8715e014581c4eef5e1e25c7e0452a528f8abdf2f2a721d17b0fa7f [2022-07-19 22:14:00,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 22:14:00,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 22:14:00,551 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 22:14:00,553 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 22:14:00,554 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 22:14:00,555 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-07-19 22:14:00,608 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928d54d8/2c63f6081f434c68b61b62fc8609a63a/FLAGdb04f2d5d [2022-07-19 22:14:01,292 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 22:14:01,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i [2022-07-19 22:14:01,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928d54d8/2c63f6081f434c68b61b62fc8609a63a/FLAGdb04f2d5d [2022-07-19 22:14:01,423 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b928d54d8/2c63f6081f434c68b61b62fc8609a63a [2022-07-19 22:14:01,425 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 22:14:01,427 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 22:14:01,428 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 22:14:01,428 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 22:14:01,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 22:14:01,432 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:14:01" (1/1) ... [2022-07-19 22:14:01,433 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240a6c2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:01, skipping insertion in model container [2022-07-19 22:14:01,433 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:14:01" (1/1) ... [2022-07-19 22:14:01,439 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 22:14:01,504 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 22:14:01,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-07-19 22:14:01,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-07-19 22:14:02,505 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,505 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,506 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,506 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,510 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,521 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,521 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,523 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,525 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,527 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,528 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,529 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:02,807 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:14:02,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:14:02,809 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:14:02,810 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:14:02,811 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:14:02,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:14:02,812 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:14:02,813 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:14:02,814 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:14:02,815 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:14:02,909 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:14:02,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:14:02,947 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 22:14:02,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2022-07-19 22:14:02,961 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2022-07-19 22:14:03,011 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,015 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,016 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,016 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,020 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,025 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,031 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,039 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,040 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,041 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,042 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,042 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,042 WARN L1550 CHandler]: Possible shadowing of function index [2022-07-19 22:14:03,075 WARN L611 FunctionHandler]: implicit declaration of function __atomic_load_n [2022-07-19 22:14:03,076 WARN L611 FunctionHandler]: implicit declaration of function __atomic_store_n [2022-07-19 22:14:03,077 WARN L611 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2022-07-19 22:14:03,078 WARN L611 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2022-07-19 22:14:03,084 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2022-07-19 22:14:03,085 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2022-07-19 22:14:03,086 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2022-07-19 22:14:03,086 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2022-07-19 22:14:03,087 WARN L611 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2022-07-19 22:14:03,087 WARN L611 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2022-07-19 22:14:03,116 WARN L611 FunctionHandler]: implicit declaration of function __builtin_va_copy [2022-07-19 22:14:03,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 22:14:03,307 INFO L208 MainTranslator]: Completed translation [2022-07-19 22:14:03,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03 WrapperNode [2022-07-19 22:14:03,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 22:14:03,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 22:14:03,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 22:14:03,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 22:14:03,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,399 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,428 INFO L137 Inliner]: procedures = 679, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 58 [2022-07-19 22:14:03,428 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 22:14:03,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 22:14:03,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 22:14:03,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 22:14:03,437 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,437 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,444 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,444 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,456 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,463 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 22:14:03,464 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 22:14:03,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 22:14:03,465 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 22:14:03,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (1/1) ... [2022-07-19 22:14:03,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 22:14:03,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:14:03,501 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 22:14:03,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 22:14:03,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-19 22:14:03,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-19 22:14:03,538 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-19 22:14:03,538 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2022-07-19 22:14:03,539 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2022-07-19 22:14:03,539 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 22:14:03,539 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-19 22:14:03,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 22:14:03,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 22:14:03,539 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-19 22:14:03,540 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-19 22:14:03,540 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-19 22:14:03,540 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-19 22:14:03,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-19 22:14:03,540 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2022-07-19 22:14:03,540 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2022-07-19 22:14:03,540 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 22:14:03,688 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 22:14:03,689 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 22:14:03,885 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 22:14:03,904 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 22:14:03,905 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-19 22:14:03,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:14:03 BoogieIcfgContainer [2022-07-19 22:14:03,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 22:14:03,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 22:14:03,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 22:14:03,911 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 22:14:03,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:14:01" (1/3) ... [2022-07-19 22:14:03,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474d6e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:14:03, skipping insertion in model container [2022-07-19 22:14:03,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:14:03" (2/3) ... [2022-07-19 22:14:03,912 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@474d6e1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:14:03, skipping insertion in model container [2022-07-19 22:14:03,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:14:03" (3/3) ... [2022-07-19 22:14:03,914 INFO L111 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2022-07-19 22:14:03,926 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 22:14:03,932 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 22:14:04,008 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 22:14:04,021 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70227794, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1175955e [2022-07-19 22:14:04,022 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 22:14:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-19 22:14:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 22:14:04,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:14:04,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:14:04,035 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:14:04,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:14:04,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1117195627, now seen corresponding path program 1 times [2022-07-19 22:14:04,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:14:04,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850432350] [2022-07-19 22:14:04,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:14:04,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:14:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:04,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:14:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:04,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:14:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:14:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:04,393 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:14:04,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:14:04,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850432350] [2022-07-19 22:14:04,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850432350] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:14:04,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:14:04,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-19 22:14:04,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006696336] [2022-07-19 22:14:04,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:14:04,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-19 22:14:04,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:14:04,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-19 22:14:04,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 22:14:04,429 INFO L87 Difference]: Start difference. First operand has 50 states, 32 states have (on average 1.21875) internal successors, (39), 33 states have internal predecessors, (39), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 22:14:04,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:14:04,455 INFO L93 Difference]: Finished difference Result 94 states and 124 transitions. [2022-07-19 22:14:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-19 22:14:04,461 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-19 22:14:04,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:14:04,469 INFO L225 Difference]: With dead ends: 94 [2022-07-19 22:14:04,469 INFO L226 Difference]: Without dead ends: 45 [2022-07-19 22:14:04,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-19 22:14:04,479 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:14:04,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:14:04,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-19 22:14:04,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-07-19 22:14:04,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 29 states have internal predecessors, (33), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 22:14:04,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-07-19 22:14:04,528 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 28 [2022-07-19 22:14:04,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:14:04,531 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-07-19 22:14:04,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 22:14:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-07-19 22:14:04,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 22:14:04,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:14:04,535 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:14:04,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 22:14:04,538 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:14:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:14:04,541 INFO L85 PathProgramCache]: Analyzing trace with hash 96127273, now seen corresponding path program 1 times [2022-07-19 22:14:04,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:14:04,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443507581] [2022-07-19 22:14:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:14:04,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:14:04,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:14:05,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:05,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:14:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:05,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:14:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:05,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:14:05,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:14:05,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443507581] [2022-07-19 22:14:05,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443507581] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:14:05,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905966950] [2022-07-19 22:14:05,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:14:05,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:14:05,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:14:05,498 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:14:05,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-19 22:14:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:05,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-19 22:14:05,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:14:05,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:05,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:05,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 22:14:05,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:05,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:05,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2022-07-19 22:14:05,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:05,790 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 20 [2022-07-19 22:14:05,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 22:14:05,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:05,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-07-19 22:14:05,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 22:14:05,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-07-19 22:14:05,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 12 [2022-07-19 22:14:05,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-07-19 22:14:06,841 INFO L356 Elim1Store]: treesize reduction 8, result has 71.4 percent of original size [2022-07-19 22:14:06,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 133 treesize of output 94 [2022-07-19 22:14:06,866 INFO L356 Elim1Store]: treesize reduction 46, result has 6.1 percent of original size [2022-07-19 22:14:06,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 35 [2022-07-19 22:14:06,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:14:06,919 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-19 22:14:06,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905966950] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:14:06,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-19 22:14:06,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [17] total 26 [2022-07-19 22:14:06,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543061362] [2022-07-19 22:14:06,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:14:06,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-19 22:14:06,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:14:06,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-19 22:14:06,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2022-07-19 22:14:06,925 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 22:14:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:14:07,021 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2022-07-19 22:14:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-19 22:14:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-07-19 22:14:07,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:14:07,026 INFO L225 Difference]: With dead ends: 70 [2022-07-19 22:14:07,027 INFO L226 Difference]: Without dead ends: 68 [2022-07-19 22:14:07,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=82, Invalid=620, Unknown=0, NotChecked=0, Total=702 [2022-07-19 22:14:07,030 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 14 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:14:07,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 503 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 104 Unchecked, 0.0s Time] [2022-07-19 22:14:07,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-19 22:14:07,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-07-19 22:14:07,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 15 states have call successors, (15), 7 states have call predecessors, (15), 8 states have return successors, (16), 14 states have call predecessors, (16), 14 states have call successors, (16) [2022-07-19 22:14:07,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-07-19 22:14:07,058 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 28 [2022-07-19 22:14:07,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:14:07,058 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-07-19 22:14:07,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 9 states have internal predecessors, (15), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-07-19 22:14:07,058 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-07-19 22:14:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 22:14:07,060 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:14:07,061 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:14:07,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-19 22:14:07,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:14:07,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:14:07,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:14:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash -713219353, now seen corresponding path program 1 times [2022-07-19 22:14:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:14:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096414464] [2022-07-19 22:14:07,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:14:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:14:07,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:07,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:14:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:07,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:14:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:07,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:14:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:07,549 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:14:07,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:14:07,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096414464] [2022-07-19 22:14:07,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096414464] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:14:07,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:14:07,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:14:07,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272130532] [2022-07-19 22:14:07,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:14:07,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:14:07,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:14:07,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:14:07,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:14:07,552 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:14:07,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:14:07,783 INFO L93 Difference]: Finished difference Result 121 states and 149 transitions. [2022-07-19 22:14:07,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:14:07,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-19 22:14:07,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:14:07,785 INFO L225 Difference]: With dead ends: 121 [2022-07-19 22:14:07,785 INFO L226 Difference]: Without dead ends: 76 [2022-07-19 22:14:07,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:14:07,786 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:14:07,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 173 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:14:07,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-19 22:14:07,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2022-07-19 22:14:07,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.163265306122449) internal successors, (57), 52 states have internal predecessors, (57), 15 states have call successors, (15), 7 states have call predecessors, (15), 9 states have return successors, (17), 14 states have call predecessors, (17), 14 states have call successors, (17) [2022-07-19 22:14:07,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2022-07-19 22:14:07,795 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 28 [2022-07-19 22:14:07,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:14:07,795 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2022-07-19 22:14:07,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:14:07,795 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2022-07-19 22:14:07,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-19 22:14:07,796 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:14:07,796 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:14:07,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 22:14:07,796 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:14:07,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:14:07,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1106246363, now seen corresponding path program 1 times [2022-07-19 22:14:07,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:14:07,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141888533] [2022-07-19 22:14:07,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:14:07,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:14:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:07,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:14:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:07,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:14:07,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:07,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:14:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:07,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:14:07,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:14:07,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141888533] [2022-07-19 22:14:07,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141888533] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:14:07,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:14:07,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:14:07,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171313326] [2022-07-19 22:14:07,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:14:07,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:14:07,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:14:07,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:14:07,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:14:07,921 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:14:07,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:14:07,944 INFO L93 Difference]: Finished difference Result 143 states and 170 transitions. [2022-07-19 22:14:07,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:14:07,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 28 [2022-07-19 22:14:07,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:14:07,946 INFO L225 Difference]: With dead ends: 143 [2022-07-19 22:14:07,946 INFO L226 Difference]: Without dead ends: 64 [2022-07-19 22:14:07,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:14:07,947 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 13 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:14:07,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 139 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:14:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-19 22:14:07,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2022-07-19 22:14:07,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.135135135135135) internal successors, (42), 38 states have internal predecessors, (42), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 22:14:07,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 65 transitions. [2022-07-19 22:14:07,953 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 65 transitions. Word has length 28 [2022-07-19 22:14:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:14:07,954 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 65 transitions. [2022-07-19 22:14:07,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-07-19 22:14:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 65 transitions. [2022-07-19 22:14:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 22:14:07,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:14:07,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:14:07,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 22:14:07,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:14:07,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:14:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash 695086179, now seen corresponding path program 1 times [2022-07-19 22:14:07,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:14:07,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629639005] [2022-07-19 22:14:07,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:14:07,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:14:07,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:14:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:14:08,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:14:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:14:08,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:14:08,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:14:08,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:14:08,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629639005] [2022-07-19 22:14:08,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629639005] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:14:08,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:14:08,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:14:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810585028] [2022-07-19 22:14:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:14:08,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:14:08,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:14:08,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:14:08,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:14:08,233 INFO L87 Difference]: Start difference. First operand 56 states and 65 transitions. Second operand has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 22:14:08,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:14:08,462 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2022-07-19 22:14:08,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-19 22:14:08,463 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-07-19 22:14:08,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:14:08,464 INFO L225 Difference]: With dead ends: 67 [2022-07-19 22:14:08,464 INFO L226 Difference]: Without dead ends: 65 [2022-07-19 22:14:08,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:14:08,465 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 29 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:14:08,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 292 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:14:08,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-19 22:14:08,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2022-07-19 22:14:08,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 42 states have (on average 1.119047619047619) internal successors, (47), 44 states have internal predecessors, (47), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-19 22:14:08,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2022-07-19 22:14:08,472 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 42 [2022-07-19 22:14:08,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:14:08,472 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2022-07-19 22:14:08,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 22:14:08,472 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-07-19 22:14:08,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 22:14:08,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:14:08,473 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:14:08,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 22:14:08,474 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:14:08,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:14:08,474 INFO L85 PathProgramCache]: Analyzing trace with hash -114260447, now seen corresponding path program 1 times [2022-07-19 22:14:08,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:14:08,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105028341] [2022-07-19 22:14:08,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:14:08,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:14:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:14:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:14:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:14:08,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:14:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:14:08,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-19 22:14:08,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:14:08,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105028341] [2022-07-19 22:14:08,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105028341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:14:08,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839076851] [2022-07-19 22:14:08,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:14:08,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:14:08,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:14:08,848 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:14:08,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-19 22:14:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:14:08,972 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-19 22:14:08,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:14:09,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:09,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:09,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 25 [2022-07-19 22:14:09,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2022-07-19 22:14:09,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-07-19 22:14:09,034 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-19 22:14:09,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 34 [2022-07-19 22:14:09,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-19 22:14:09,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-07-19 22:14:09,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2022-07-19 22:14:09,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-19 22:14:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 22:14:34,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:14:55,075 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:14:55,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:14:55,084 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:14:55,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 62 [2022-07-19 22:14:55,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:14:55,093 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-19 22:14:55,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 108 [2022-07-19 22:14:55,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-19 22:14:55,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 55 [2022-07-19 22:14:55,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-19 22:14:55,105 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2022-07-19 22:14:55,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-19 22:14:55,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:14:55,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839076851] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-19 22:14:55,256 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-19 22:14:55,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16, 10] total 32 [2022-07-19 22:14:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848658648] [2022-07-19 22:14:55,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:14:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-19 22:14:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:14:55,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-19 22:14:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=884, Unknown=18, NotChecked=0, Total=992 [2022-07-19 22:14:55,257 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 22:15:05,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:05,606 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2022-07-19 22:15:05,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:15:05,607 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 42 [2022-07-19 22:15:05,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:05,608 INFO L225 Difference]: With dead ends: 105 [2022-07-19 22:15:05,608 INFO L226 Difference]: Without dead ends: 70 [2022-07-19 22:15:05,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 70 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=128, Invalid=1255, Unknown=23, NotChecked=0, Total=1406 [2022-07-19 22:15:05,609 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 73 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:05,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 137 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:15:05,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-19 22:15:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2022-07-19 22:15:05,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 49 states have internal predecessors, (52), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2022-07-19 22:15:05,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2022-07-19 22:15:05,619 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 42 [2022-07-19 22:15:05,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:05,619 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2022-07-19 22:15:05,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-19 22:15:05,620 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2022-07-19 22:15:05,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-19 22:15:05,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:05,621 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:05,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-19 22:15:05,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-19 22:15:05,836 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:05,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:05,836 INFO L85 PathProgramCache]: Analyzing trace with hash -507287457, now seen corresponding path program 1 times [2022-07-19 22:15:05,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:05,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459441388] [2022-07-19 22:15:05,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:05,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:05,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:05,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:05,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:05,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:05,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:05,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,030 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-07-19 22:15:06,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:06,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459441388] [2022-07-19 22:15:06,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459441388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:15:06,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:15:06,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-19 22:15:06,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764544954] [2022-07-19 22:15:06,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:15:06,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-19 22:15:06,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:06,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-19 22:15:06,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-19 22:15:06,033 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 22:15:06,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:06,117 INFO L93 Difference]: Finished difference Result 116 states and 135 transitions. [2022-07-19 22:15:06,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:15:06,117 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2022-07-19 22:15:06,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:06,118 INFO L225 Difference]: With dead ends: 116 [2022-07-19 22:15:06,118 INFO L226 Difference]: Without dead ends: 71 [2022-07-19 22:15:06,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:15:06,120 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:06,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 205 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:15:06,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-19 22:15:06,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-07-19 22:15:06,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 46 states have internal predecessors, (50), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:15:06,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2022-07-19 22:15:06,127 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 42 [2022-07-19 22:15:06,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:06,127 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2022-07-19 22:15:06,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-07-19 22:15:06,128 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2022-07-19 22:15:06,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-19 22:15:06,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:06,129 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:06,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 22:15:06,129 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:06,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:06,130 INFO L85 PathProgramCache]: Analyzing trace with hash 709260864, now seen corresponding path program 1 times [2022-07-19 22:15:06,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:06,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019645973] [2022-07-19 22:15:06,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:06,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:06,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:06,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:15:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-07-19 22:15:06,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:06,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019645973] [2022-07-19 22:15:06,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019645973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:15:06,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:15:06,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-19 22:15:06,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952954047] [2022-07-19 22:15:06,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:15:06,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-19 22:15:06,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:06,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-19 22:15:06,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-19 22:15:06,269 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:15:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:06,352 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2022-07-19 22:15:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-19 22:15:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2022-07-19 22:15:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:06,354 INFO L225 Difference]: With dead ends: 71 [2022-07-19 22:15:06,354 INFO L226 Difference]: Without dead ends: 69 [2022-07-19 22:15:06,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:15:06,355 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:06,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 210 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:15:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-19 22:15:06,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-07-19 22:15:06,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 47 states have (on average 1.127659574468085) internal successors, (53), 49 states have internal predecessors, (53), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:15:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 77 transitions. [2022-07-19 22:15:06,362 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 77 transitions. Word has length 48 [2022-07-19 22:15:06,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:06,362 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 77 transitions. [2022-07-19 22:15:06,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-07-19 22:15:06,363 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 77 transitions. [2022-07-19 22:15:06,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:15:06,363 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:06,364 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:06,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 22:15:06,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:06,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:06,364 INFO L85 PathProgramCache]: Analyzing trace with hash -593356994, now seen corresponding path program 1 times [2022-07-19 22:15:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:06,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844329532] [2022-07-19 22:15:06,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:15:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:15:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:15:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,651 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 22:15:06,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:06,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844329532] [2022-07-19 22:15:06,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844329532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:15:06,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:15:06,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-19 22:15:06,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560648297] [2022-07-19 22:15:06,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:15:06,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-19 22:15:06,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:06,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-19 22:15:06,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-19 22:15:06,654 INFO L87 Difference]: Start difference. First operand 69 states and 77 transitions. Second operand has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:15:06,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:06,892 INFO L93 Difference]: Finished difference Result 80 states and 88 transitions. [2022-07-19 22:15:06,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-19 22:15:06,893 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2022-07-19 22:15:06,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:06,894 INFO L225 Difference]: With dead ends: 80 [2022-07-19 22:15:06,894 INFO L226 Difference]: Without dead ends: 78 [2022-07-19 22:15:06,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-07-19 22:15:06,894 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 19 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:06,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 297 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:15:06,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-19 22:15:06,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2022-07-19 22:15:06,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 55 states have internal predecessors, (58), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-19 22:15:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-07-19 22:15:06,902 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 63 [2022-07-19 22:15:06,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:06,902 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-07-19 22:15:06,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 4.25) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:15:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-07-19 22:15:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:15:06,904 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:06,904 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:06,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 22:15:06,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:06,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:06,905 INFO L85 PathProgramCache]: Analyzing trace with hash -1402703620, now seen corresponding path program 1 times [2022-07-19 22:15:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:06,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733597330] [2022-07-19 22:15:06,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:06,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:06,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:07,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:15:07,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:15:07,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:15:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,091 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 22:15:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:07,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733597330] [2022-07-19 22:15:07,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733597330] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:15:07,092 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:15:07,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-19 22:15:07,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004529093] [2022-07-19 22:15:07,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:15:07,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-19 22:15:07,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:07,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-19 22:15:07,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-19 22:15:07,094 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:15:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:07,222 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-19 22:15:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-19 22:15:07,223 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 63 [2022-07-19 22:15:07,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:07,224 INFO L225 Difference]: With dead ends: 107 [2022-07-19 22:15:07,224 INFO L226 Difference]: Without dead ends: 80 [2022-07-19 22:15:07,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:15:07,225 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 26 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:07,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 151 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:15:07,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-19 22:15:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2022-07-19 22:15:07,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 57 states have internal predecessors, (60), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-19 22:15:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 87 transitions. [2022-07-19 22:15:07,232 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 87 transitions. Word has length 63 [2022-07-19 22:15:07,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:07,233 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 87 transitions. [2022-07-19 22:15:07,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-19 22:15:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 87 transitions. [2022-07-19 22:15:07,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-07-19 22:15:07,234 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:07,234 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:07,234 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 22:15:07,235 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:07,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:07,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1795730630, now seen corresponding path program 1 times [2022-07-19 22:15:07,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:07,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000057650] [2022-07-19 22:15:07,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:07,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:07,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:07,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:07,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:15:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:15:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:15:07,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,349 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-07-19 22:15:07,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:07,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000057650] [2022-07-19 22:15:07,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000057650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:15:07,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:15:07,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-19 22:15:07,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938494944] [2022-07-19 22:15:07,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:15:07,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-19 22:15:07,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:07,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-19 22:15:07,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:15:07,351 INFO L87 Difference]: Start difference. First operand 79 states and 87 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 22:15:07,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:07,366 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-07-19 22:15:07,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-19 22:15:07,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 63 [2022-07-19 22:15:07,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:07,367 INFO L225 Difference]: With dead ends: 110 [2022-07-19 22:15:07,368 INFO L226 Difference]: Without dead ends: 73 [2022-07-19 22:15:07,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-19 22:15:07,369 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 9 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:07,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 143 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 22:15:07,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-19 22:15:07,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-07-19 22:15:07,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 12 states have call successors, (12), 9 states have call predecessors, (12), 10 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2022-07-19 22:15:07,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 78 transitions. [2022-07-19 22:15:07,375 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 78 transitions. Word has length 63 [2022-07-19 22:15:07,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:07,376 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 78 transitions. [2022-07-19 22:15:07,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-07-19 22:15:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 78 transitions. [2022-07-19 22:15:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 22:15:07,377 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:07,377 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:07,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 22:15:07,377 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:07,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:07,378 INFO L85 PathProgramCache]: Analyzing trace with hash 180273006, now seen corresponding path program 1 times [2022-07-19 22:15:07,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:07,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395174630] [2022-07-19 22:15:07,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:07,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:07,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:07,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:07,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:07,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:15:07,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:15:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:15:07,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:15:07,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:15:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:07,854 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 22:15:07,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:07,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395174630] [2022-07-19 22:15:07,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395174630] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:15:07,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:15:07,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-19 22:15:07,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120374347] [2022-07-19 22:15:07,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:15:07,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-19 22:15:07,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:07,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-19 22:15:07,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:15:07,857 INFO L87 Difference]: Start difference. First operand 73 states and 78 transitions. Second operand has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-19 22:15:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:08,353 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-07-19 22:15:08,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-19 22:15:08,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 77 [2022-07-19 22:15:08,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:08,355 INFO L225 Difference]: With dead ends: 84 [2022-07-19 22:15:08,355 INFO L226 Difference]: Without dead ends: 82 [2022-07-19 22:15:08,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-19 22:15:08,356 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 48 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:08,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 294 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-19 22:15:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-19 22:15:08,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2022-07-19 22:15:08,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 58 states have internal predecessors, (59), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-19 22:15:08,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2022-07-19 22:15:08,363 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 77 [2022-07-19 22:15:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:08,363 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2022-07-19 22:15:08,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 7 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-07-19 22:15:08,363 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2022-07-19 22:15:08,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 22:15:08,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:08,364 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:08,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 22:15:08,364 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:08,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:08,365 INFO L85 PathProgramCache]: Analyzing trace with hash -629073620, now seen corresponding path program 1 times [2022-07-19 22:15:08,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:08,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128289546] [2022-07-19 22:15:08,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:08,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:08,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:08,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:08,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:08,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:08,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:15:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:15:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:15:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:15:08,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:15:08,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:15:08,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128289546] [2022-07-19 22:15:08,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128289546] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:15:08,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486731927] [2022-07-19 22:15:08,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:08,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:15:08,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:15:08,649 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:15:08,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-19 22:15:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:08,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-19 22:15:08,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:15:09,716 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_7|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_7|) 0)))) is different from true [2022-07-19 22:15:10,532 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_8|) 0)))) is different from true [2022-07-19 22:15:11,369 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_1|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_1|) 0)))) is different from true [2022-07-19 22:15:12,215 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_2|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_2|) 0)))) is different from true [2022-07-19 22:15:13,072 WARN L855 $PredicateComparison]: unable to prove that (or (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 0))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3| Int)) (not (= (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base_BEFORE_CALL_3|) |v_ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset_BEFORE_CALL_3|) 0)))) is different from true [2022-07-19 22:15:25,782 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 38 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 12 not checked. [2022-07-19 22:15:25,782 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:15:26,063 INFO L356 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-07-19 22:15:26,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2022-07-19 22:15:26,069 INFO L356 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-07-19 22:15:26,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 12 [2022-07-19 22:15:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 22:15:26,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486731927] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:15:26,084 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:15:26,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 18, 13] total 26 [2022-07-19 22:15:26,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781912074] [2022-07-19 22:15:26,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:15:26,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-19 22:15:26,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:26,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-19 22:15:26,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=358, Unknown=9, NotChecked=210, Total=650 [2022-07-19 22:15:26,086 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 22:15:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:52,580 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2022-07-19 22:15:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-19 22:15:52,580 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) Word has length 77 [2022-07-19 22:15:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:52,581 INFO L225 Difference]: With dead ends: 100 [2022-07-19 22:15:52,581 INFO L226 Difference]: Without dead ends: 85 [2022-07-19 22:15:52,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 155 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 215 ImplicationChecksByTransitivity, 43.2s TimeCoverageRelationStatistics Valid=248, Invalid=1013, Unknown=19, NotChecked=360, Total=1640 [2022-07-19 22:15:52,583 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 577 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:52,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 355 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 195 Invalid, 0 Unknown, 577 Unchecked, 0.1s Time] [2022-07-19 22:15:52,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-19 22:15:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-19 22:15:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 58 states have internal predecessors, (58), 13 states have call successors, (13), 10 states have call predecessors, (13), 12 states have return successors, (14), 12 states have call predecessors, (14), 12 states have call successors, (14) [2022-07-19 22:15:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 85 transitions. [2022-07-19 22:15:52,600 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 85 transitions. Word has length 77 [2022-07-19 22:15:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:52,600 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 85 transitions. [2022-07-19 22:15:52,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.423076923076923) internal successors, (63), 25 states have internal predecessors, (63), 4 states have call successors, (16), 7 states have call predecessors, (16), 8 states have return successors, (15), 4 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-19 22:15:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-07-19 22:15:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-19 22:15:52,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:52,601 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:52,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-19 22:15:52,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:15:52,802 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1022100630, now seen corresponding path program 1 times [2022-07-19 22:15:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:52,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206305855] [2022-07-19 22:15:52,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:52,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:52,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:52,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:15:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:15:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:15:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:15:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:15:53,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 22:15:53,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:53,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206305855] [2022-07-19 22:15:53,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206305855] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-19 22:15:53,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748180166] [2022-07-19 22:15:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:53,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:15:53,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 22:15:53,055 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-19 22:15:53,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-19 22:15:53,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:53,202 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-19 22:15:53,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-19 22:15:53,339 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-07-19 22:15:53,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-19 22:15:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-19 22:15:53,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748180166] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-19 22:15:53,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-19 22:15:53,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 12 [2022-07-19 22:15:53,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145702995] [2022-07-19 22:15:53,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-19 22:15:53,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-19 22:15:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:53,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-19 22:15:53,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-19 22:15:53,560 INFO L87 Difference]: Start difference. First operand 81 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 22:15:53,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:53,726 INFO L93 Difference]: Finished difference Result 104 states and 107 transitions. [2022-07-19 22:15:53,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-19 22:15:53,727 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 77 [2022-07-19 22:15:53,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:53,727 INFO L225 Difference]: With dead ends: 104 [2022-07-19 22:15:53,728 INFO L226 Difference]: Without dead ends: 72 [2022-07-19 22:15:53,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 165 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-19 22:15:53,729 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 38 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:53,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 243 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:15:53,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-19 22:15:53,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2022-07-19 22:15:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 48 states have (on average 1.0) internal successors, (48), 48 states have internal predecessors, (48), 12 states have call successors, (12), 10 states have call predecessors, (12), 9 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-19 22:15:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-07-19 22:15:53,736 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 77 [2022-07-19 22:15:53,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:53,736 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-07-19 22:15:53,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2022-07-19 22:15:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-07-19 22:15:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-19 22:15:53,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 22:15:53,738 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:53,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-19 22:15:53,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-19 22:15:53,956 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 22:15:53,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 22:15:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1529037313, now seen corresponding path program 1 times [2022-07-19 22:15:53,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 22:15:53,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257983760] [2022-07-19 22:15:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 22:15:53,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 22:15:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-19 22:15:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-19 22:15:54,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-19 22:15:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-07-19 22:15:54,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-07-19 22:15:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-19 22:15:54,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-19 22:15:54,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-19 22:15:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-07-19 22:15:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-19 22:15:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-19 22:15:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 22:15:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-07-19 22:15:54,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 22:15:54,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257983760] [2022-07-19 22:15:54,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257983760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 22:15:54,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 22:15:54,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-19 22:15:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172129924] [2022-07-19 22:15:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 22:15:54,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-19 22:15:54,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 22:15:54,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-19 22:15:54,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-19 22:15:54,315 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-19 22:15:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 22:15:54,558 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-19 22:15:54,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-19 22:15:54,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) Word has length 83 [2022-07-19 22:15:54,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 22:15:54,560 INFO L225 Difference]: With dead ends: 70 [2022-07-19 22:15:54,560 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 22:15:54,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2022-07-19 22:15:54,561 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 19 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-19 22:15:54,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 268 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-19 22:15:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 22:15:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 22:15:54,562 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) [2022-07-19 22:15:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 22:15:54,563 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 83 [2022-07-19 22:15:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 22:15:54,563 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 22:15:54,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 6 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (11), 4 states have call predecessors, (11), 6 states have call successors, (11) [2022-07-19 22:15:54,563 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 22:15:54,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 22:15:54,566 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 22:15:54,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 22:15:54,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 22:15:55,675 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validFINAL(lines 4717 4721) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_next_is_validENTRY(lines 4717 4721) the Hoare annotation is: true [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validFINAL(lines 4728 4732) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2022-07-19 22:15:55,676 INFO L902 garLoopResultBuilder]: At program point aws_linked_list_node_prev_is_validENTRY(lines 4728 4732) the Hoare annotation is: true [2022-07-19 22:15:55,677 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2022-07-19 22:15:55,677 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 22:15:55,677 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-07-19 22:15:55,677 INFO L902 garLoopResultBuilder]: At program point L7393(line 7393) the Hoare annotation is: true [2022-07-19 22:15:55,677 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2022-07-19 22:15:55,677 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret675#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-07-19 22:15:55,677 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-07-19 22:15:55,677 INFO L895 garLoopResultBuilder]: At program point L4854(lines 4848 4855) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0))) [2022-07-19 22:15:55,677 INFO L895 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret337#1| 1))) [2022-07-19 22:15:55,677 INFO L899 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2022-07-19 22:15:55,677 INFO L895 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2022-07-19 22:15:55,677 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-07-19 22:15:55,678 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 22:15:55,678 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 22:15:55,678 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 22:15:55,678 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2022-07-19 22:15:55,678 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (<= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret676#1| 1) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_#res#1.base|) |ULTIMATE.start_aws_linked_list_prev_#res#1.offset|) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|))) [2022-07-19 22:15:55,678 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse1 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select .cse0 .cse1) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 .cse2) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse2) .cse3) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3))) (= (select .cse4 8) 0) (not (= (select .cse0 8) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select .cse4 .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2022-07-19 22:15:55,678 INFO L895 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 .cse1) (<= |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (<= 1 |ULTIMATE.start_aws_linked_list_prev_#t~ret336#1|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2022-07-19 22:15:55,678 INFO L895 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|)) (.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8)) (.cse0 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0) |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 .cse1) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (= .cse1 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= (select (select |#memory_$Pointer$.base| .cse1) .cse2) |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (not (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_#t~mem338#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) .cse0)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset|) (<= 0 |#StackHeapBarrier|) (not (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| 0)))) [2022-07-19 22:15:55,678 INFO L899 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2022-07-19 22:15:55,678 INFO L899 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2022-07-19 22:15:55,678 INFO L895 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse6 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse4 .cse6)) (.cse2 (select .cse5 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| .cse1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)))) (= (select .cse4 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (<= 0 |#StackHeapBarrier|)))) [2022-07-19 22:15:55,679 INFO L899 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2022-07-19 22:15:55,679 INFO L899 garLoopResultBuilder]: For program point L7376(lines 7376 7392) no Hoare annotation was computed. [2022-07-19 22:15:55,679 INFO L895 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse4 (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse5 (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (.cse6 (+ |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 8))) (let ((.cse0 (select .cse5 .cse6)) (.cse1 (select .cse4 .cse6)) (.cse2 (select .cse5 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (< 0 (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse2) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| .cse1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| (let ((.cse3 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse3)))) (= (select .cse4 8) 0) (not (= .cse2 0)) (not (= .cse2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret334#1| 1) (<= 0 |#StackHeapBarrier|)))) [2022-07-19 22:15:55,679 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:15:55,679 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 210 212) the Hoare annotation is: true [2022-07-19 22:15:55,679 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2022-07-19 22:15:55,679 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2022-07-19 22:15:55,680 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2022-07-19 22:15:55,680 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 222 224) the Hoare annotation is: true [2022-07-19 22:15:55,680 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2022-07-19 22:15:55,680 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:15:55,680 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2022-07-19 22:15:55,680 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2022-07-19 22:15:55,683 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 22:15:55,684 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 22:15:55,695 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,696 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,697 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,698 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,701 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,702 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,703 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:15:55 BoogieIcfgContainer [2022-07-19 22:15:55,705 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 22:15:55,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 22:15:55,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 22:15:55,706 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 22:15:55,706 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:14:03" (3/4) ... [2022-07-19 22:15:55,708 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 22:15:55,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2022-07-19 22:15:55,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2022-07-19 22:15:55,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2022-07-19 22:15:55,714 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-07-19 22:15:55,718 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-19 22:15:55,718 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-07-19 22:15:55,718 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 22:15:55,719 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 22:15:55,746 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((node == node && #memory_$Pointer$[node][node + 8] == before) && before == \result) && 0 < #memory_$Pointer$[rval][rval]) && node == node) && #memory_$Pointer$[rval][rval] == node) && #memory_$Pointer$[#memory_$Pointer$[rval][rval]][node + 8] == rval) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][#memory_$Pointer$[node][node + 8]]) && before == \result) && rval == #memory_$Pointer$[node][node + 8]) && before == rval) && 0 <= unknown-#StackHeapBarrier-unknown) && !(rval == 0)) && #memory_$Pointer$[\result][\result] == 0 [2022-07-19 22:15:55,767 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 22:15:55,770 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 22:15:55,770 INFO L158 Benchmark]: Toolchain (without parser) took 114343.75ms. Allocated memory was 111.1MB in the beginning and 167.8MB in the end (delta: 56.6MB). Free memory was 77.5MB in the beginning and 90.0MB in the end (delta: -12.5MB). Peak memory consumption was 44.6MB. Max. memory is 16.1GB. [2022-07-19 22:15:55,771 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 81.8MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 22:15:55,771 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1879.96ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 77.2MB in the beginning and 85.0MB in the end (delta: -7.8MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2022-07-19 22:15:55,771 INFO L158 Benchmark]: Boogie Procedure Inliner took 119.66ms. Allocated memory is still 134.2MB. Free memory was 85.0MB in the beginning and 80.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 22:15:55,771 INFO L158 Benchmark]: Boogie Preprocessor took 33.92ms. Allocated memory is still 134.2MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 22:15:55,772 INFO L158 Benchmark]: RCFGBuilder took 442.27ms. Allocated memory is still 134.2MB. Free memory was 78.1MB in the beginning and 60.6MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-07-19 22:15:55,773 INFO L158 Benchmark]: TraceAbstraction took 111797.01ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 59.9MB in the beginning and 93.2MB in the end (delta: -33.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. [2022-07-19 22:15:55,773 INFO L158 Benchmark]: Witness Printer took 64.52ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 90.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 22:15:55,774 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.18ms. Allocated memory is still 81.8MB. Free memory is still 46.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1879.96ms. Allocated memory was 111.1MB in the beginning and 134.2MB in the end (delta: 23.1MB). Free memory was 77.2MB in the beginning and 85.0MB in the end (delta: -7.8MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 119.66ms. Allocated memory is still 134.2MB. Free memory was 85.0MB in the beginning and 80.2MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.92ms. Allocated memory is still 134.2MB. Free memory was 80.2MB in the beginning and 78.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 442.27ms. Allocated memory is still 134.2MB. Free memory was 78.1MB in the beginning and 60.6MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 111797.01ms. Allocated memory was 134.2MB in the beginning and 167.8MB in the end (delta: 33.6MB). Free memory was 59.9MB in the beginning and 93.2MB in the end (delta: -33.3MB). Peak memory consumption was 66.7MB. Max. memory is 16.1GB. * Witness Printer took 64.52ms. Allocated memory is still 167.8MB. Free memory was 93.2MB in the beginning and 90.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 223]: 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, 50 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 111.7s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 39.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 439 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 370 mSDsluCounter, 3471 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 681 IncrementalHoareTripleChecker+Unchecked, 2699 mSDsCounter, 231 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1691 IncrementalHoareTripleChecker+Invalid, 2603 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 231 mSolverCounterUnsat, 772 mSDtfsCounter, 1691 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 797 GetRequests, 569 SyntacticMatches, 18 SemanticMatches, 210 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 699 ImplicationChecksByTransitivity, 101.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=12, InterpolantAutomatonStates: 139, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 28 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 90 PreInvPairs, 103 NumberOfFragments, 1313 HoareAnnotationTreeSize, 90 FomulaSimplifications, 409 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 18 FomulaSimplificationsInter, 2602 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 69.1s InterpolantComputationTime, 1013 NumberOfCodeBlocks, 1013 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1187 ConstructedInterpolants, 77 QuantifiedInterpolants, 10000 SizeOfPredicates, 80 NumberOfNonLiveVariables, 1169 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 22 InterpolantComputations, 13 PerfectInterpolantSequences, 648/710 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7393]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4848]: Loop Invariant [2022-07-19 22:15:55,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,786 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,787 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,788 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,789 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2022-07-19 22:15:55,790 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2022-07-19 22:15:55,791 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset Derived loop invariant: (((((((((((((node == node && #memory_$Pointer$[node][node + 8] == before) && before == \result) && 0 < #memory_$Pointer$[rval][rval]) && node == node) && #memory_$Pointer$[rval][rval] == node) && #memory_$Pointer$[#memory_$Pointer$[rval][rval]][node + 8] == rval) && !(before == node)) && node == #memory_$Pointer$[#memory_$Pointer$[node][node + 8]][#memory_$Pointer$[node][node + 8]]) && before == \result) && rval == #memory_$Pointer$[node][node + 8]) && before == rval) && 0 <= unknown-#StackHeapBarrier-unknown) && !(rval == 0)) && #memory_$Pointer$[\result][\result] == 0 RESULT: Ultimate proved your program to be correct! [2022-07-19 22:15:56,019 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-19 22:15:56,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE