./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_prev_harness.i --full-output --preprocessor.use.memory.slicer false --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version abd6749d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/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 --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 --preprocessor.use.memory.slicer false --- Real Ultimate output --- This is Ultimate 0.2.3-?-abd6749-m [2023-11-23 08:52:22,330 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 08:52:22,396 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-23 08:52:22,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 08:52:22,408 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 08:52:22,434 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 08:52:22,435 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 08:52:22,435 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 08:52:22,436 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 08:52:22,440 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 08:52:22,440 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 08:52:22,441 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 08:52:22,442 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 08:52:22,443 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 08:52:22,444 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 08:52:22,444 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 08:52:22,444 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 08:52:22,444 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 08:52:22,445 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 08:52:22,445 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 08:52:22,445 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 08:52:22,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 08:52:22,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 08:52:22,446 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 08:52:22,447 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 08:52:22,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 08:52:22,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 08:52:22,452 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 08:52:22,452 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:22,453 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 08:52:22,454 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 08:52:22,454 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 08:52:22,455 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 08:52:22,455 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 08:52:22,455 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 08:52:22,455 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 08:52:22,455 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 08:52:22,456 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 08:52:22,456 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 08:52:22,456 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Use memory slicer -> false [2023-11-23 08:52:22,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 08:52:22,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 08:52:22,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 08:52:22,770 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 08:52:22,770 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 08:52:22,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/aws-c-common/aws_linked_list_prev_harness.i [2023-11-23 08:52:24,012 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 08:52:24,514 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 08:52:24,515 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_prev_harness.i [2023-11-23 08:52:24,554 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f899d7fd/008066dbc65845ae9c2e41a5db7ee58a/FLAGdb7f69d7e [2023-11-23 08:52:24,571 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f899d7fd/008066dbc65845ae9c2e41a5db7ee58a [2023-11-23 08:52:24,575 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 08:52:24,577 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 08:52:24,580 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:24,580 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 08:52:24,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 08:52:24,587 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:24" (1/1) ... [2023-11-23 08:52:24,588 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3da5c190 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:24, skipping insertion in model container [2023-11-23 08:52:24,589 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:24" (1/1) ... [2023-11-23 08:52:24,675 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 08:52:24,937 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2023-11-23 08:52:24,946 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2023-11-23 08:52:25,589 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,590 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,591 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,592 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,596 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,619 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,619 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,621 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,622 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,624 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,625 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,626 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,627 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:25,999 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:26,000 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:26,002 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:26,003 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:26,004 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:26,020 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:26,021 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:26,022 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:26,022 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:26,023 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:26,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:26,170 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 08:52:26,188 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_prev_harness.i[4494,4507] [2023-11-23 08:52:26,189 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/aws-c-common/aws_linked_list_prev_harness.i[4554,4567] [2023-11-23 08:52:26,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,229 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,230 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,231 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,239 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,240 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,251 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,251 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,252 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,253 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,254 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,254 WARN L1590 CHandler]: Possible shadowing of function index [2023-11-23 08:52:26,315 WARN L635 FunctionHandler]: implicit declaration of function __atomic_load_n [2023-11-23 08:52:26,317 WARN L635 FunctionHandler]: implicit declaration of function __atomic_store_n [2023-11-23 08:52:26,317 WARN L635 FunctionHandler]: implicit declaration of function __atomic_exchange_n [2023-11-23 08:52:26,318 WARN L635 FunctionHandler]: implicit declaration of function __atomic_compare_exchange_n [2023-11-23 08:52:26,324 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_add [2023-11-23 08:52:26,325 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_sub [2023-11-23 08:52:26,326 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_or [2023-11-23 08:52:26,328 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_and [2023-11-23 08:52:26,329 WARN L635 FunctionHandler]: implicit declaration of function __atomic_fetch_xor [2023-11-23 08:52:26,329 WARN L635 FunctionHandler]: implicit declaration of function __atomic_thread_fence [2023-11-23 08:52:26,393 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 08:52:26,562 WARN L675 CHandler]: The function __atomic_fetch_or is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,562 WARN L675 CHandler]: The function __atomic_fetch_sub is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,563 WARN L675 CHandler]: The function __atomic_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,563 WARN L675 CHandler]: The function __atomic_fetch_xor is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,563 WARN L675 CHandler]: The function htons is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,563 WARN L675 CHandler]: The function ntohl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,564 WARN L675 CHandler]: The function __atomic_compare_exchange_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,564 WARN L675 CHandler]: The function __atomic_fetch_add is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,564 WARN L675 CHandler]: The function htonl is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,564 WARN L675 CHandler]: The function __atomic_store_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,565 WARN L675 CHandler]: The function ntohs is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,565 WARN L675 CHandler]: The function __atomic_load_n is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,565 WARN L675 CHandler]: The function __atomic_thread_fence is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,566 WARN L675 CHandler]: The function __atomic_fetch_and is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,566 WARN L675 CHandler]: The function aws_array_list_ensure_capacity is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 08:52:26,573 INFO L206 MainTranslator]: Completed translation [2023-11-23 08:52:26,574 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26 WrapperNode [2023-11-23 08:52:26,574 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 08:52:26,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 08:52:26,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 08:52:26,576 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 08:52:26,582 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,688 INFO L138 Inliner]: procedures = 678, calls = 1039, calls flagged for inlining = 50, calls inlined = 4, statements flattened = 56 [2023-11-23 08:52:26,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 08:52:26,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 08:52:26,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 08:52:26,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 08:52:26,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,698 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,700 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,701 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,711 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,714 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 08:52:26,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 08:52:26,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 08:52:26,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 08:52:26,721 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (1/1) ... [2023-11-23 08:52:26,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 08:52:26,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:26,806 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) [2023-11-23 08:52:26,863 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 [2023-11-23 08:52:26,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 08:52:26,908 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 08:52:26,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 08:52:26,909 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:52:26,909 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2023-11-23 08:52:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 08:52:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-23 08:52:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 08:52:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 08:52:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-23 08:52:26,910 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-23 08:52:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 08:52:26,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-23 08:52:26,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-23 08:52:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:52:26,912 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:52:26,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 08:52:27,164 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 08:52:27,166 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 08:52:27,358 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 08:52:27,408 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 08:52:27,414 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 08:52:27,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:27 BoogieIcfgContainer [2023-11-23 08:52:27,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 08:52:27,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 08:52:27,423 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 08:52:27,426 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 08:52:27,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:24" (1/3) ... [2023-11-23 08:52:27,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c918302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:27, skipping insertion in model container [2023-11-23 08:52:27,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:26" (2/3) ... [2023-11-23 08:52:27,430 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c918302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:27, skipping insertion in model container [2023-11-23 08:52:27,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:27" (3/3) ... [2023-11-23 08:52:27,432 INFO L112 eAbstractionObserver]: Analyzing ICFG aws_linked_list_prev_harness.i [2023-11-23 08:52:27,450 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 08:52:27,451 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 08:52:27,501 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 08:52:27,507 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=LoopHeads, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d5821b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 08:52:27,508 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 08:52:27,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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) [2023-11-23 08:52:27,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 08:52:27,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:27,521 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] [2023-11-23 08:52:27,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:27,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:27,527 INFO L85 PathProgramCache]: Analyzing trace with hash -118563777, now seen corresponding path program 1 times [2023-11-23 08:52:27,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:27,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305184649] [2023-11-23 08:52:27,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:27,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:27,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:52:27,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:52:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:52:27,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:27,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305184649] [2023-11-23 08:52:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305184649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:27,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:52:27,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 08:52:27,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567465539] [2023-11-23 08:52:27,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:27,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-23 08:52:27,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-23 08:52:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-23 08:52:27,994 INFO L87 Difference]: Start difference. First operand has 43 states, 25 states have (on average 1.28) internal successors, (32), 26 states have internal predecessors, (32), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-23 08:52:28,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:28,043 INFO L93 Difference]: Finished difference Result 81 states and 111 transitions. [2023-11-23 08:52:28,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-23 08:52:28,046 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 25 [2023-11-23 08:52:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:28,053 INFO L225 Difference]: With dead ends: 81 [2023-11-23 08:52:28,053 INFO L226 Difference]: Without dead ends: 41 [2023-11-23 08:52:28,064 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 [2023-11-23 08:52:28,069 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:28,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:52:28,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2023-11-23 08:52:28,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2023-11-23 08:52:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 25 states have internal predecessors, (29), 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) [2023-11-23 08:52:28,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 52 transitions. [2023-11-23 08:52:28,126 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 52 transitions. Word has length 25 [2023-11-23 08:52:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:28,128 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 52 transitions. [2023-11-23 08:52:28,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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) [2023-11-23 08:52:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 52 transitions. [2023-11-23 08:52:28,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 08:52:28,134 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:28,135 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] [2023-11-23 08:52:28,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 08:52:28,138 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:28,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1398427455, now seen corresponding path program 1 times [2023-11-23 08:52:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122674574] [2023-11-23 08:52:28,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:28,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:29,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:29,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:52:29,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:29,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:52:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:30,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:52:30,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122674574] [2023-11-23 08:52:30,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122674574] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595222427] [2023-11-23 08:52:30,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:30,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:30,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:30,252 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) [2023-11-23 08:52:30,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 08:52:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:30,433 INFO L262 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-23 08:52:30,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:30,511 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:52:30,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-11-23 08:52:30,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2023-11-23 08:52:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:52:31,716 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:52:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595222427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:52:31,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [17] total 26 [2023-11-23 08:52:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271858684] [2023-11-23 08:52:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:31,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-23 08:52:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:31,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-23 08:52:31,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=578, Unknown=0, NotChecked=0, Total=650 [2023-11-23 08:52:31,719 INFO L87 Difference]: Start difference. First operand 41 states and 52 transitions. Second operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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) [2023-11-23 08:52:32,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:32,415 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2023-11-23 08:52:32,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-23 08:52:32,415 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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 25 [2023-11-23 08:52:32,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:32,418 INFO L225 Difference]: With dead ends: 55 [2023-11-23 08:52:32,418 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 08:52:32,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=115, Invalid=877, Unknown=0, NotChecked=0, Total=992 [2023-11-23 08:52:32,419 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 53 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:32,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 193 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 08:52:32,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 08:52:32,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2023-11-23 08:52:32,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 30 states have internal predecessors, (33), 13 states have call successors, (13), 5 states have call predecessors, (13), 6 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:52:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2023-11-23 08:52:32,433 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 25 [2023-11-23 08:52:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:32,433 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2023-11-23 08:52:32,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 1.3) internal successors, (13), 8 states have internal predecessors, (13), 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) [2023-11-23 08:52:32,434 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2023-11-23 08:52:32,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 08:52:32,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:32,435 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] [2023-11-23 08:52:32,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-23 08:52:32,654 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 [2023-11-23 08:52:32,654 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:32,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:32,654 INFO L85 PathProgramCache]: Analyzing trace with hash 376579907, now seen corresponding path program 1 times [2023-11-23 08:52:32,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:32,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282668879] [2023-11-23 08:52:32,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:32,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:32,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:33,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:33,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:52:33,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:33,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:52:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 08:52:33,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:33,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282668879] [2023-11-23 08:52:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282668879] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:33,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603716763] [2023-11-23 08:52:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:33,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:33,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:33,333 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) [2023-11-23 08:52:33,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 08:52:33,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:33,447 INFO L262 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-23 08:52:33,449 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:33,464 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 18 [2023-11-23 08:52:33,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 08:52:33,478 INFO L378 Elim1Store]: Elim1 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 44 treesize of output 43 [2023-11-23 08:52:33,485 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:52:34,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:52:34,016 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:52:34,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603716763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:34,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:52:34,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [14] total 20 [2023-11-23 08:52:34,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769514316] [2023-11-23 08:52:34,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:34,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:52:34,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:34,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:52:34,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:52:34,018 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2023-11-23 08:52:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:34,337 INFO L93 Difference]: Finished difference Result 99 states and 126 transitions. [2023-11-23 08:52:34,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:52:34,338 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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 25 [2023-11-23 08:52:34,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:34,339 INFO L225 Difference]: With dead ends: 99 [2023-11-23 08:52:34,339 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 08:52:34,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 19 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2023-11-23 08:52:34,340 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 45 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:34,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 95 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:52:34,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 08:52:34,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2023-11-23 08:52:34,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 34 states have internal predecessors, (37), 13 states have call successors, (13), 5 states have call predecessors, (13), 7 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-23 08:52:34,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2023-11-23 08:52:34,354 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 25 [2023-11-23 08:52:34,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:34,357 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2023-11-23 08:52:34,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 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) [2023-11-23 08:52:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2023-11-23 08:52:34,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-23 08:52:34,359 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:34,359 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:52:34,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-23 08:52:34,574 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,SelfDestructingSolverStorable2 [2023-11-23 08:52:34,575 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:34,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1056638277, now seen corresponding path program 1 times [2023-11-23 08:52:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:34,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049833659] [2023-11-23 08:52:34,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:34,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:34,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:34,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:34,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:34,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:52:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:34,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:52:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:34,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:52:34,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:34,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049833659] [2023-11-23 08:52:34,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049833659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:52:34,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:52:34,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:52:34,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119206435] [2023-11-23 08:52:34,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:52:34,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:52:34,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:34,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:52:34,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:52:34,697 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-11-23 08:52:34,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:52:34,738 INFO L93 Difference]: Finished difference Result 103 states and 130 transitions. [2023-11-23 08:52:34,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:52:34,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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 25 [2023-11-23 08:52:34,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:52:34,740 INFO L225 Difference]: With dead ends: 103 [2023-11-23 08:52:34,740 INFO L226 Difference]: Without dead ends: 53 [2023-11-23 08:52:34,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:52:34,745 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 4 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:52:34,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 125 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:52:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-23 08:52:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 49. [2023-11-23 08:52:34,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.2) internal successors, (36), 32 states have internal predecessors, (36), 12 states have call successors, (12), 5 states have call predecessors, (12), 6 states have return successors, (12), 11 states have call predecessors, (12), 11 states have call successors, (12) [2023-11-23 08:52:34,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-11-23 08:52:34,762 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 25 [2023-11-23 08:52:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:52:34,763 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-11-23 08:52:34,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 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) [2023-11-23 08:52:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-11-23 08:52:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 08:52:34,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:52:34,766 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:52:34,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 08:52:34,766 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:52:34,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:52:34,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1572387641, now seen corresponding path program 1 times [2023-11-23 08:52:34,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:52:34,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378166902] [2023-11-23 08:52:34,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:34,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:52:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:35,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:52:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:35,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:52:35,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:35,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:52:35,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:35,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:52:35,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:35,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:52:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:35,883 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:52:35,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:52:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378166902] [2023-11-23 08:52:35,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378166902] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:52:35,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054537476] [2023-11-23 08:52:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:52:35,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:52:35,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:52:35,888 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) [2023-11-23 08:52:35,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 08:52:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:52:36,013 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-23 08:52:36,017 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:52:36,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-23 08:52:36,039 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:52:36,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 11 [2023-11-23 08:52:37,584 INFO L349 Elim1Store]: treesize reduction 13, result has 60.6 percent of original size [2023-11-23 08:52:37,585 INFO L378 Elim1Store]: Elim1 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 8 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 89 [2023-11-23 08:52:37,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-11-23 08:52:37,618 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:52:42,192 WARN L854 $PredicateComparison]: unable to prove that (or (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_5| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_5|)) (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_5|))))) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_5| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_5| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_5|)) (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_5|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_5|)))))) (not (= (mod |c___VERIFIER_assert_#in~cond| 256) 0)) (= (mod c___VERIFIER_assert_~cond 256) 0)) is different from false [2023-11-23 08:52:44,427 WARN L854 $PredicateComparison]: unable to prove that (or (= (mod |c_aws_linked_list_node_prev_is_valid_#res| 256) 0) (let ((.cse2 (+ 8 |c_aws_linked_list_node_prev_is_valid_#in~node.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_aws_linked_list_node_prev_is_valid_#in~node.base|) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$.offset| |c_aws_linked_list_node_prev_is_valid_#in~node.base|) .cse2))) (and (= |c_aws_linked_list_node_prev_is_valid_#in~node.base| (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)) (= (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1) |c_aws_linked_list_node_prev_is_valid_#in~node.offset|)))) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|) 8)) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|)) (+ (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_6|) 8)))))) is different from false [2023-11-23 08:52:44,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-23 08:52:44,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054537476] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:52:44,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:52:44,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 16] total 42 [2023-11-23 08:52:44,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242715177] [2023-11-23 08:52:44,625 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:52:44,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-11-23 08:52:44,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:52:44,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-11-23 08:52:44,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1426, Unknown=3, NotChecked=154, Total=1722 [2023-11-23 08:52:44,628 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 42 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 34 states have internal predecessors, (69), 12 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-23 08:53:08,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:08,915 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2023-11-23 08:53:08,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-23 08:53:08,916 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 34 states have internal predecessors, (69), 12 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) Word has length 38 [2023-11-23 08:53:08,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:08,917 INFO L225 Difference]: With dead ends: 70 [2023-11-23 08:53:08,917 INFO L226 Difference]: Without dead ends: 64 [2023-11-23 08:53:08,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 53 SyntacticMatches, 9 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 31.0s TimeCoverageRelationStatistics Valid=305, Invalid=3006, Unknown=3, NotChecked=226, Total=3540 [2023-11-23 08:53:08,919 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 90 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 136 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:08,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 408 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 787 Invalid, 0 Unknown, 136 Unchecked, 0.9s Time] [2023-11-23 08:53:08,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2023-11-23 08:53:08,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 60. [2023-11-23 08:53:08,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 40 states have internal predecessors, (44), 13 states have call successors, (13), 7 states have call predecessors, (13), 8 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:53:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2023-11-23 08:53:08,930 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 38 [2023-11-23 08:53:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:08,931 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2023-11-23 08:53:08,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 34 states have internal predecessors, (69), 12 states have call successors, (15), 4 states have call predecessors, (15), 11 states have return successors, (15), 10 states have call predecessors, (15), 10 states have call successors, (15) [2023-11-23 08:53:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2023-11-23 08:53:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 08:53:08,932 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:08,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:08,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:09,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:09,139 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:09,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:09,139 INFO L85 PathProgramCache]: Analyzing trace with hash 202619721, now seen corresponding path program 1 times [2023-11-23 08:53:09,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:09,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133356695] [2023-11-23 08:53:09,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:09,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:09,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:09,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:53:09,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133356695] [2023-11-23 08:53:09,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133356695] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:09,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397603845] [2023-11-23 08:53:09,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:09,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:09,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:09,780 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) [2023-11-23 08:53:09,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 08:53:09,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:09,931 INFO L262 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-23 08:53:09,934 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:09,959 INFO L349 Elim1Store]: treesize reduction 35, result has 2.8 percent of original size [2023-11-23 08:53:09,960 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 1 [2023-11-23 08:53:09,967 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:53:09,981 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 30 [2023-11-23 08:53:09,986 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-11-23 08:53:10,548 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2023-11-23 08:53:11,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 08:53:11,646 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:12,082 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:53:12,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397603845] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:12,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:12,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15, 9] total 29 [2023-11-23 08:53:12,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156069144] [2023-11-23 08:53:12,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:12,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:53:12,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:12,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:53:12,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=717, Unknown=0, NotChecked=0, Total=812 [2023-11-23 08:53:12,084 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2023-11-23 08:53:12,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:12,335 INFO L93 Difference]: Finished difference Result 100 states and 122 transitions. [2023-11-23 08:53:12,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:53:12,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 38 [2023-11-23 08:53:12,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:12,337 INFO L225 Difference]: With dead ends: 100 [2023-11-23 08:53:12,337 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 08:53:12,338 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 63 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=118, Invalid=874, Unknown=0, NotChecked=0, Total=992 [2023-11-23 08:53:12,338 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 15 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:12,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 156 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:12,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 08:53:12,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2023-11-23 08:53:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 41 states have (on average 1.170731707317073) internal successors, (48), 44 states have internal predecessors, (48), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (16), 12 states have call predecessors, (16), 12 states have call successors, (16) [2023-11-23 08:53:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 77 transitions. [2023-11-23 08:53:12,353 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 77 transitions. Word has length 38 [2023-11-23 08:53:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:12,353 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 77 transitions. [2023-11-23 08:53:12,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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) [2023-11-23 08:53:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2023-11-23 08:53:12,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-23 08:53:12,358 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:12,358 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:12,380 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:12,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:12,576 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:12,576 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:12,576 INFO L85 PathProgramCache]: Analyzing trace with hash 882678091, now seen corresponding path program 1 times [2023-11-23 08:53:12,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:12,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555204599] [2023-11-23 08:53:12,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:12,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:12,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:13,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:13,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:13,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:13,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:13,077 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 08:53:13,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:13,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555204599] [2023-11-23 08:53:13,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555204599] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:13,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [475705305] [2023-11-23 08:53:13,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:13,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:13,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:13,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:53:13,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 08:53:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:13,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-23 08:53:13,196 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:13,203 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 18 [2023-11-23 08:53:13,214 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 08:53:13,215 INFO L378 Elim1Store]: Elim1 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 44 treesize of output 43 [2023-11-23 08:53:13,220 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:53:13,420 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 11 [2023-11-23 08:53:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 08:53:13,492 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:13,602 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-23 08:53:13,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [475705305] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:13,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:13,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11, 7] total 18 [2023-11-23 08:53:13,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121341140] [2023-11-23 08:53:13,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:13,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:53:13,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:13,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:53:13,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2023-11-23 08:53:13,604 INFO L87 Difference]: Start difference. First operand 64 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2023-11-23 08:53:13,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:13,701 INFO L93 Difference]: Finished difference Result 109 states and 131 transitions. [2023-11-23 08:53:13,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:53:13,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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 38 [2023-11-23 08:53:13,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:13,702 INFO L225 Difference]: With dead ends: 109 [2023-11-23 08:53:13,702 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 08:53:13,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 72 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2023-11-23 08:53:13,703 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 5 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:13,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 197 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 08:53:13,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 61. [2023-11-23 08:53:13,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 40 states have (on average 1.175) internal successors, (47), 42 states have internal predecessors, (47), 12 states have call successors, (12), 7 states have call predecessors, (12), 8 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-23 08:53:13,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 72 transitions. [2023-11-23 08:53:13,716 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 72 transitions. Word has length 38 [2023-11-23 08:53:13,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:13,716 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 72 transitions. [2023-11-23 08:53:13,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 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) [2023-11-23 08:53:13,717 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 72 transitions. [2023-11-23 08:53:13,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 08:53:13,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:13,719 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:13,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:13,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:13,935 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:13,936 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash 467448740, now seen corresponding path program 1 times [2023-11-23 08:53:13,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:13,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85191129] [2023-11-23 08:53:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:14,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:14,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:14,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:14,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:14,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:14,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:14,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-11-23 08:53:14,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:14,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85191129] [2023-11-23 08:53:14,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85191129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:14,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:14,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 08:53:14,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273990845] [2023-11-23 08:53:14,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:14,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 08:53:14,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:14,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 08:53:14,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 08:53:14,246 INFO L87 Difference]: Start difference. First operand 61 states and 72 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2023-11-23 08:53:14,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:14,349 INFO L93 Difference]: Finished difference Result 67 states and 77 transitions. [2023-11-23 08:53:14,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 08:53:14,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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 44 [2023-11-23 08:53:14,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:14,351 INFO L225 Difference]: With dead ends: 67 [2023-11-23 08:53:14,352 INFO L226 Difference]: Without dead ends: 65 [2023-11-23 08:53:14,353 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 [2023-11-23 08:53:14,353 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 6 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:14,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 203 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:14,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2023-11-23 08:53:14,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2023-11-23 08:53:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 45 states have internal predecessors, (50), 12 states have call successors, (12), 8 states have call predecessors, (12), 9 states have return successors, (13), 11 states have call predecessors, (13), 11 states have call successors, (13) [2023-11-23 08:53:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2023-11-23 08:53:14,371 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 44 [2023-11-23 08:53:14,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:14,372 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2023-11-23 08:53:14,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 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) [2023-11-23 08:53:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2023-11-23 08:53:14,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 08:53:14,376 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:14,376 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-11-23 08:53:14,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 08:53:14,377 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:14,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:14,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1717426378, now seen corresponding path program 1 times [2023-11-23 08:53:14,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:14,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013939774] [2023-11-23 08:53:14,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:14,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:15,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:15,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,297 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 08:53:15,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:15,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013939774] [2023-11-23 08:53:15,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013939774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:15,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:15,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-23 08:53:15,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540734405] [2023-11-23 08:53:15,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:15,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-23 08:53:15,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:15,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-23 08:53:15,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-23 08:53:15,299 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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) [2023-11-23 08:53:15,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:15,573 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2023-11-23 08:53:15,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:53:15,574 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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 57 [2023-11-23 08:53:15,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:15,575 INFO L225 Difference]: With dead ends: 75 [2023-11-23 08:53:15,575 INFO L226 Difference]: Without dead ends: 73 [2023-11-23 08:53:15,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:53:15,576 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 15 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:15,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 256 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:53:15,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-11-23 08:53:15,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2023-11-23 08:53:15,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.148936170212766) internal successors, (54), 50 states have internal predecessors, (54), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:53:15,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2023-11-23 08:53:15,595 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 57 [2023-11-23 08:53:15,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:15,595 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2023-11-23 08:53:15,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 4.142857142857143) internal successors, (29), 8 states have internal predecessors, (29), 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) [2023-11-23 08:53:15,596 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2023-11-23 08:53:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 08:53:15,597 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:15,597 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-11-23 08:53:15,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 08:53:15,598 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:15,598 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:15,598 INFO L85 PathProgramCache]: Analyzing trace with hash -802533556, now seen corresponding path program 1 times [2023-11-23 08:53:15,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:15,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45761405] [2023-11-23 08:53:15,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:15,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:15,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:15,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:16,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:16,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:16,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:16,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 9 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 08:53:16,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45761405] [2023-11-23 08:53:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45761405] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959986633] [2023-11-23 08:53:16,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:16,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:16,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:16,280 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:53:16,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 08:53:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:16,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-23 08:53:16,418 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:16,426 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 18 [2023-11-23 08:53:16,436 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-23 08:53:16,437 INFO L378 Elim1Store]: Elim1 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 44 treesize of output 43 [2023-11-23 08:53:16,441 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:53:17,302 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 08:53:17,302 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 08:53:17,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959986633] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:17,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-23 08:53:17,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 17 [2023-11-23 08:53:17,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691374173] [2023-11-23 08:53:17,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:17,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 08:53:17,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:17,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 08:53:17,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2023-11-23 08:53:17,303 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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) [2023-11-23 08:53:17,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:17,660 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2023-11-23 08:53:17,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 08:53:17,660 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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 57 [2023-11-23 08:53:17,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:17,661 INFO L225 Difference]: With dead ends: 96 [2023-11-23 08:53:17,661 INFO L226 Difference]: Without dead ends: 72 [2023-11-23 08:53:17,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 52 SyntacticMatches, 14 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2023-11-23 08:53:17,662 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:17,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 90 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-23 08:53:17,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-11-23 08:53:17,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2023-11-23 08:53:17,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 48 states have internal predecessors, (51), 13 states have call successors, (13), 9 states have call predecessors, (13), 11 states have return successors, (15), 12 states have call predecessors, (15), 12 states have call successors, (15) [2023-11-23 08:53:17,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 79 transitions. [2023-11-23 08:53:17,678 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 79 transitions. Word has length 57 [2023-11-23 08:53:17,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:17,679 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 79 transitions. [2023-11-23 08:53:17,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 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) [2023-11-23 08:53:17,679 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 79 transitions. [2023-11-23 08:53:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-11-23 08:53:17,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:17,681 INFO L195 NwaCegarLoop]: trace histogram [4, 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] [2023-11-23 08:53:17,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:17,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:17,900 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:17,901 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:17,901 INFO L85 PathProgramCache]: Analyzing trace with hash -122475186, now seen corresponding path program 1 times [2023-11-23 08:53:17,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:17,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945311435] [2023-11-23 08:53:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:17,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:17,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:17,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:17,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:18,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:18,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:18,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:18,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:18,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:18,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:18,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:18,065 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2023-11-23 08:53:18,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:18,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945311435] [2023-11-23 08:53:18,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945311435] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 08:53:18,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 08:53:18,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 08:53:18,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173563218] [2023-11-23 08:53:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:18,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 08:53:18,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:18,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 08:53:18,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:18,068 INFO L87 Difference]: Start difference. First operand 70 states and 79 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2023-11-23 08:53:18,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:18,112 INFO L93 Difference]: Finished difference Result 96 states and 108 transitions. [2023-11-23 08:53:18,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 08:53:18,112 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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 57 [2023-11-23 08:53:18,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:18,115 INFO L225 Difference]: With dead ends: 96 [2023-11-23 08:53:18,115 INFO L226 Difference]: Without dead ends: 63 [2023-11-23 08:53:18,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 08:53:18,116 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:18,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 161 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 08:53:18,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-11-23 08:53:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2023-11-23 08:53:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 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) [2023-11-23 08:53:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2023-11-23 08:53:18,133 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 57 [2023-11-23 08:53:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:18,134 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2023-11-23 08:53:18,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 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) [2023-11-23 08:53:18,135 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2023-11-23 08:53:18,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:53:18,135 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:18,135 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2023-11-23 08:53:18,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 08:53:18,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:18,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:18,136 INFO L85 PathProgramCache]: Analyzing trace with hash 2070633576, now seen corresponding path program 1 times [2023-11-23 08:53:18,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:18,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12108119] [2023-11-23 08:53:18,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:18,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:19,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:19,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:19,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:19,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:19,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:53:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:19,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,659 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2023-11-23 08:53:19,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:19,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12108119] [2023-11-23 08:53:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12108119] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12836648] [2023-11-23 08:53:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:19,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:19,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:53:19,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 08:53:19,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:19,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 79 conjunts are in the unsatisfiable core [2023-11-23 08:53:19,822 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:19,857 INFO L349 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-11-23 08:53:19,858 INFO L378 Elim1Store]: Elim1 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2023-11-23 08:53:19,869 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:53:19,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2023-11-23 08:53:22,895 INFO L349 Elim1Store]: treesize reduction 77, result has 40.3 percent of original size [2023-11-23 08:53:22,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 213 treesize of output 142 [2023-11-23 08:53:22,950 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2023-11-23 08:53:22,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:25,522 WARN L854 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (and (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_24| Int)) (= (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_18|)) (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_18|))) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_24|)) (forall ((|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_24| Int)) (= |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_18| (select (select |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_18|)) (+ 8 (select (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base_BEFORE_CALL_24|) |v_ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset_BEFORE_CALL_18|)))))) (= (mod c___VERIFIER_assert_~cond 256) 0)) is different from false [2023-11-23 08:53:25,705 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 34 trivial. 1 not checked. [2023-11-23 08:53:25,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12836648] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:53:25,705 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:53:25,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 44 [2023-11-23 08:53:25,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671025700] [2023-11-23 08:53:25,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:25,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-23 08:53:25,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:25,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-23 08:53:25,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1662, Unknown=1, NotChecked=82, Total=1892 [2023-11-23 08:53:25,708 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand has 44 states, 32 states have (on average 2.65625) internal successors, (85), 36 states have internal predecessors, (85), 16 states have call successors, (30), 4 states have call predecessors, (30), 9 states have return successors, (29), 14 states have call predecessors, (29), 14 states have call successors, (29) [2023-11-23 08:53:48,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:48,717 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2023-11-23 08:53:48,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-23 08:53:48,717 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 32 states have (on average 2.65625) internal successors, (85), 36 states have internal predecessors, (85), 16 states have call successors, (30), 4 states have call predecessors, (30), 9 states have return successors, (29), 14 states have call predecessors, (29), 14 states have call successors, (29) Word has length 70 [2023-11-23 08:53:48,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:48,718 INFO L225 Difference]: With dead ends: 71 [2023-11-23 08:53:48,718 INFO L226 Difference]: Without dead ends: 69 [2023-11-23 08:53:48,719 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 118 SyntacticMatches, 17 SemanticMatches, 58 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=290, Invalid=3135, Unknown=1, NotChecked=114, Total=3540 [2023-11-23 08:53:48,720 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 46 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:48,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 455 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 925 Invalid, 0 Unknown, 56 Unchecked, 0.9s Time] [2023-11-23 08:53:48,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-11-23 08:53:48,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2023-11-23 08:53:48,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.0930232558139534) internal successors, (47), 46 states have internal predecessors, (47), 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) [2023-11-23 08:53:48,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 74 transitions. [2023-11-23 08:53:48,734 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 74 transitions. Word has length 70 [2023-11-23 08:53:48,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:48,735 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 74 transitions. [2023-11-23 08:53:48,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 32 states have (on average 2.65625) internal successors, (85), 36 states have internal predecessors, (85), 16 states have call successors, (30), 4 states have call predecessors, (30), 9 states have return successors, (29), 14 states have call predecessors, (29), 14 states have call successors, (29) [2023-11-23 08:53:48,735 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2023-11-23 08:53:48,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:53:48,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:48,736 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 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] [2023-11-23 08:53:48,749 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:48,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:48,938 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:48,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -449326358, now seen corresponding path program 1 times [2023-11-23 08:53:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505502993] [2023-11-23 08:53:48,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:49,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:49,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:49,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:49,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:53:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-23 08:53:49,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505502993] [2023-11-23 08:53:49,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505502993] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:49,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1285543372] [2023-11-23 08:53:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:49,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:49,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:49,625 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:53:49,626 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 08:53:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:49,794 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-23 08:53:49,797 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:49,811 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:53:49,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 1 [2023-11-23 08:53:49,828 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 30 [2023-11-23 08:53:49,831 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2023-11-23 08:53:51,118 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-23 08:53:51,118 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 7 [2023-11-23 08:53:51,944 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 14 proven. 18 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 08:53:51,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:52,526 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 08:53:52,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1285543372] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:52,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-23 08:53:52,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11, 12] total 29 [2023-11-23 08:53:52,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923460038] [2023-11-23 08:53:52,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 08:53:52,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 08:53:52,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:52,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 08:53:52,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=711, Unknown=0, NotChecked=0, Total=812 [2023-11-23 08:53:52,528 INFO L87 Difference]: Start difference. First operand 68 states and 74 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:53:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:52,835 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2023-11-23 08:53:52,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-23 08:53:52,836 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) Word has length 70 [2023-11-23 08:53:52,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:52,837 INFO L225 Difference]: With dead ends: 79 [2023-11-23 08:53:52,837 INFO L226 Difference]: Without dead ends: 68 [2023-11-23 08:53:52,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 126 SyntacticMatches, 15 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=122, Invalid=870, Unknown=0, NotChecked=0, Total=992 [2023-11-23 08:53:52,840 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 15 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:52,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 122 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 08:53:52,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-23 08:53:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-23 08:53:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 43 states have (on average 1.069767441860465) internal successors, (46), 46 states have internal predecessors, (46), 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) [2023-11-23 08:53:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 73 transitions. [2023-11-23 08:53:52,878 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 73 transitions. Word has length 70 [2023-11-23 08:53:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:52,878 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 73 transitions. [2023-11-23 08:53:52,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 4 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 4 states have call predecessors, (10), 3 states have call successors, (10) [2023-11-23 08:53:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 73 transitions. [2023-11-23 08:53:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-23 08:53:52,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:52,880 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:53:52,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:53,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 08:53:53,093 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:53,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:53,093 INFO L85 PathProgramCache]: Analyzing trace with hash 230732012, now seen corresponding path program 1 times [2023-11-23 08:53:53,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:53,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555119767] [2023-11-23 08:53:53,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:53,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:53,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:53,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:53:53,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:53,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,634 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 08:53:53,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:53,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555119767] [2023-11-23 08:53:53,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555119767] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:53,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365530772] [2023-11-23 08:53:53,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:53,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:53,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:53,649 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:53:53,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 08:53:53,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:53,818 INFO L262 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-23 08:53:53,826 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:53,934 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2023-11-23 08:53:53,935 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:53:54,114 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2023-11-23 08:53:54,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365530772] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:53:54,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:53:54,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 11 [2023-11-23 08:53:54,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307094066] [2023-11-23 08:53:54,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:53:54,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 08:53:54,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:53:54,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 08:53:54,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-23 08:53:54,116 INFO L87 Difference]: Start difference. First operand 68 states and 73 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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) [2023-11-23 08:53:54,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:53:54,338 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2023-11-23 08:53:54,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 08:53:54,338 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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 70 [2023-11-23 08:53:54,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:53:54,339 INFO L225 Difference]: With dead ends: 89 [2023-11-23 08:53:54,339 INFO L226 Difference]: Without dead ends: 61 [2023-11-23 08:53:54,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2023-11-23 08:53:54,339 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 13 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 08:53:54,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 296 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 08:53:54,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-11-23 08:53:54,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2023-11-23 08:53:54,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.0) internal successors, (38), 38 states have internal predecessors, (38), 12 states have call successors, (12), 9 states have call predecessors, (12), 8 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 08:53:54,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2023-11-23 08:53:54,352 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 70 [2023-11-23 08:53:54,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:53:54,352 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2023-11-23 08:53:54,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 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) [2023-11-23 08:53:54,353 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2023-11-23 08:53:54,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-11-23 08:53:54,353 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 08:53:54,353 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 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] [2023-11-23 08:53:54,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 08:53:54,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-23 08:53:54,555 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 08:53:54,555 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 08:53:54,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1883194501, now seen corresponding path program 1 times [2023-11-23 08:53:54,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 08:53:54,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798360889] [2023-11-23 08:53:54,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:54,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 08:53:54,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-23 08:53:55,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-23 08:53:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-23 08:53:55,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-23 08:53:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-23 08:53:55,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-23 08:53:55,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-23 08:53:55,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-23 08:53:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-23 08:53:55,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-23 08:53:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-23 08:53:55,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,529 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-23 08:53:55,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 08:53:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798360889] [2023-11-23 08:53:55,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798360889] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 08:53:55,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892892938] [2023-11-23 08:53:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 08:53:55,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 08:53:55,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 08:53:55,532 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 08:53:55,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 08:53:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 08:53:55,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-23 08:53:55,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 08:53:55,710 INFO L378 Elim1Store]: Elim1 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 [2023-11-23 08:53:55,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 18 [2023-11-23 08:53:55,721 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 13 [2023-11-23 08:53:55,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 18 treesize of output 18 [2023-11-23 08:53:55,735 INFO L378 Elim1Store]: Elim1 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 18 treesize of output 13 [2023-11-23 08:53:57,771 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_36| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_36| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_36|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_36|)) |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_36|))) is different from true [2023-11-23 08:53:59,858 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_37| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_37| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_37|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_37|)) |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_37|))) is different from true [2023-11-23 08:54:01,950 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_38| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_38| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_38|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_38|)) |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_38|))) is different from true [2023-11-23 08:54:04,005 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_39| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_39| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_39| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_39|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_39|))))) is different from true [2023-11-23 08:54:06,093 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_31| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_40| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_31|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_40|)) |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_31|))) is different from true [2023-11-23 08:54:08,155 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_32| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_23| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_32|) (+ |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_23| 8)) |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_32|))) is different from true [2023-11-23 08:54:08,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 28 treesize of output 10 [2023-11-23 08:54:10,244 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_33| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_33| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_33|) (+ |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_24| 8))))) is different from true [2023-11-23 08:54:16,451 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_24| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_33| Int)) (not (= |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_33| (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_33|) (+ |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_24| 8))))) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_34| Int) (|v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_25| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_34|) (+ |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset_BEFORE_CALL_25| 8)) |v_ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base_BEFORE_CALL_34|)))) is different from true [2023-11-23 08:54:16,530 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-23 08:54:16,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 [2023-11-23 08:54:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 4 proven. 7 refuted. 24 times theorem prover too weak. 4 trivial. 35 not checked. [2023-11-23 08:54:16,584 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 08:54:19,029 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-11-23 08:54:19,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892892938] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 08:54:19,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-23 08:54:19,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 21, 11] total 36 [2023-11-23 08:54:19,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041356313] [2023-11-23 08:54:19,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-23 08:54:19,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-23 08:54:19,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 08:54:19,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-23 08:54:19,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=659, Unknown=11, NotChecked=472, Total=1260 [2023-11-23 08:54:19,031 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 36 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 13 states have call successors, (30), 11 states have call predecessors, (30), 10 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) [2023-11-23 08:54:25,456 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:27,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:29,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:37,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:39,513 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-23 08:54:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 08:54:39,603 INFO L93 Difference]: Finished difference Result 77 states and 76 transitions. [2023-11-23 08:54:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-23 08:54:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 13 states have call successors, (30), 11 states have call predecessors, (30), 10 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) Word has length 76 [2023-11-23 08:54:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 08:54:39,604 INFO L225 Difference]: With dead ends: 77 [2023-11-23 08:54:39,604 INFO L226 Difference]: Without dead ends: 0 [2023-11-23 08:54:39,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 9 SemanticMatches, 40 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 33.0s TimeCoverageRelationStatistics Valid=183, Invalid=957, Unknown=14, NotChecked=568, Total=1722 [2023-11-23 08:54:39,606 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 23 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 15 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 1144 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-23 08:54:39,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 238 Invalid, 1469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 305 Invalid, 5 Unknown, 1144 Unchecked, 10.3s Time] [2023-11-23 08:54:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-23 08:54:39,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-23 08:54:39,606 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) [2023-11-23 08:54:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-23 08:54:39,606 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 76 [2023-11-23 08:54:39,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 08:54:39,607 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-23 08:54:39,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 31 states have (on average 2.4838709677419355) internal successors, (77), 30 states have internal predecessors, (77), 13 states have call successors, (30), 11 states have call predecessors, (30), 10 states have return successors, (29), 11 states have call predecessors, (29), 13 states have call successors, (29) [2023-11-23 08:54:39,607 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-23 08:54:39,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-23 08:54:39,610 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 08:54:39,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 08:54:39,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-23 08:54:39,813 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-23 08:54:50,825 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_next_is_validEXIT(lines 4717 4721) no Hoare annotation was computed. [2023-11-23 08:54:50,825 INFO L899 garLoopResultBuilder]: For program point L4720-2(line 4720) no Hoare annotation was computed. [2023-11-23 08:54:50,825 INFO L899 garLoopResultBuilder]: For program point L4720(line 4720) no Hoare annotation was computed. [2023-11-23 08:54:50,825 INFO L899 garLoopResultBuilder]: For program point L4720-5(line 4720) no Hoare annotation was computed. [2023-11-23 08:54:50,825 INFO L899 garLoopResultBuilder]: For program point L4720-3(line 4720) no Hoare annotation was computed. [2023-11-23 08:54:50,825 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4717 4721) the Hoare annotation is: true [2023-11-23 08:54:50,825 INFO L899 garLoopResultBuilder]: For program point L4731(line 4731) no Hoare annotation was computed. [2023-11-23 08:54:50,825 INFO L899 garLoopResultBuilder]: For program point aws_linked_list_node_prev_is_validEXIT(lines 4728 4732) no Hoare annotation was computed. [2023-11-23 08:54:50,826 INFO L899 garLoopResultBuilder]: For program point L4731-5(line 4731) no Hoare annotation was computed. [2023-11-23 08:54:50,826 INFO L899 garLoopResultBuilder]: For program point L4731-2(line 4731) no Hoare annotation was computed. [2023-11-23 08:54:50,826 INFO L899 garLoopResultBuilder]: For program point L4731-3(line 4731) no Hoare annotation was computed. [2023-11-23 08:54:50,826 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 4728 4732) the Hoare annotation is: true [2023-11-23 08:54:50,826 INFO L899 garLoopResultBuilder]: For program point L7391-1(line 7391) no Hoare annotation was computed. [2023-11-23 08:54:50,826 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-23 08:54:50,826 INFO L895 garLoopResultBuilder]: At program point L7391(line 7391) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8))) (and (= (select (select |#memory_$Pointer$.base| .cse0) 0) |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|)) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8) 0)))) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2) 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_~rval~10#1.base| .cse1) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4|)))) (and (<= 2 .cse3) (<= 2 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (not (= .cse3 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|))))) (<= 2 .cse1)))) [2023-11-23 08:54:50,826 INFO L899 garLoopResultBuilder]: For program point L7389-2(line 7389) no Hoare annotation was computed. [2023-11-23 08:54:50,827 INFO L895 garLoopResultBuilder]: At program point L7389-1(line 7389) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8))) (and (= (select (select |#memory_$Pointer$.base| .cse0) 0) |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|)) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8) 0)))) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2) 0) (= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret680#1| 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_~rval~10#1.base| .cse1) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4|)))) (and (<= 2 .cse3) (<= 2 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (not (= .cse3 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|))))) (<= 2 .cse1)))) [2023-11-23 08:54:50,833 INFO L895 garLoopResultBuilder]: At program point L7389(line 7389) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8))) (and (= (select (select |#memory_$Pointer$.base| .cse0) 0) |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|)) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8) 0)))) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2) 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_~rval~10#1.base| .cse1) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4|)))) (and (<= 2 .cse3) (<= 2 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (not (= .cse3 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|))))) (<= 2 .cse1)))) [2023-11-23 08:54:50,835 INFO L895 garLoopResultBuilder]: At program point L4852-1(line 4852) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret344#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 08:54:50,835 INFO L899 garLoopResultBuilder]: For program point L4852-2(line 4852) no Hoare annotation was computed. [2023-11-23 08:54:50,835 INFO L895 garLoopResultBuilder]: At program point L4852(line 4852) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 08:54:50,835 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-23 08:54:50,836 INFO L895 garLoopResultBuilder]: At program point L7390(line 7390) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8))) (and (= (select (select |#memory_$Pointer$.base| .cse0) 0) |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|)) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8) 0)))) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2) 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_~rval~10#1.base| .cse1) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4|)))) (and (<= 2 .cse3) (<= 2 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (not (= .cse3 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|))))) (<= 2 .cse1)))) [2023-11-23 08:54:50,836 INFO L899 garLoopResultBuilder]: For program point L7390-2(line 7390) no Hoare annotation was computed. [2023-11-23 08:54:50,836 INFO L895 garLoopResultBuilder]: At program point L7390-1(line 7390) the Hoare annotation is: (let ((.cse2 (+ |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 8))) (let ((.cse1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (<= 1 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.base|) 0)) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7| Int)) (let ((.cse0 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8))) (and (= (select (select |#memory_$Pointer$.base| .cse0) 0) |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) (not (= .cse0 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|)) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (= (select (select |#memory_$Pointer$.offset| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_7|) 8) 0)))) (= |ULTIMATE.start_aws_linked_list_prev_harness_#t~ret681#1| 1) (= 0 |ULTIMATE.start_aws_linked_list_prev_harness_~rval~10#1.offset|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base| .cse1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) .cse2) 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_~rval~10#1.base| .cse1) (= (select (select |#memory_$Pointer$.base| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= (select (select |#memory_$Pointer$.offset| .cse1) 0) |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset|) (exists ((|v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4| Int) (|v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4| Int)) (let ((.cse3 (select (select |#memory_$Pointer$.base| |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (+ 8 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.offset_BEFORE_CALL_4|)))) (and (<= 2 .cse3) (<= 2 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|) (not (= .cse3 |v_ULTIMATE.start_aws_linked_list_prev_~node#1.base_BEFORE_CALL_4|))))) (<= 2 .cse1)))) [2023-11-23 08:54:50,836 INFO L895 garLoopResultBuilder]: At program point L4851(line 4851) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 08:54:50,837 INFO L895 garLoopResultBuilder]: At program point L4851-1(line 4851) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_#t~ret343#1| 1) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 08:54:50,837 INFO L895 garLoopResultBuilder]: At program point L4853(line 4853) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (= |ULTIMATE.start_aws_linked_list_prev_#t~mem345#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_#t~mem345#1.base| |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~rval~5#1.offset| 0))) [2023-11-23 08:54:50,837 INFO L899 garLoopResultBuilder]: For program point L4853-1(line 4853) no Hoare annotation was computed. [2023-11-23 08:54:50,837 INFO L899 garLoopResultBuilder]: For program point L4849-2(line 4849) no Hoare annotation was computed. [2023-11-23 08:54:50,837 INFO L895 garLoopResultBuilder]: At program point L4849(line 4849) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)))) [2023-11-23 08:54:50,837 INFO L899 garLoopResultBuilder]: For program point L4851-2(line 4851) no Hoare annotation was computed. [2023-11-23 08:54:50,838 INFO L895 garLoopResultBuilder]: At program point L4849-1(line 4849) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8))) (and (= |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.offset| 0) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| .cse0) 0) 0) (<= 2 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (= |ULTIMATE.start_aws_linked_list_prev_~node#1.offset| 0) (= (select (select |#memory_$Pointer$.base| .cse0) 0) |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) (<= 2 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_aws_linked_list_prev_harness_~#node~1#1.base|) 8)) (= .cse0 |ULTIMATE.start_aws_linked_list_prev_harness_~#before~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_aws_linked_list_prev_~node#1.base|) 8) 0) (not (= .cse0 |ULTIMATE.start_aws_linked_list_prev_~node#1.base|)))) [2023-11-23 08:54:50,838 INFO L899 garLoopResultBuilder]: For program point L211-2(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:54:50,838 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 210 212) the Hoare annotation is: true [2023-11-23 08:54:50,838 INFO L899 garLoopResultBuilder]: For program point L211(line 211) no Hoare annotation was computed. [2023-11-23 08:54:50,838 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 210 212) no Hoare annotation was computed. [2023-11-23 08:54:50,838 INFO L899 garLoopResultBuilder]: For program point L223(line 223) no Hoare annotation was computed. [2023-11-23 08:54:50,838 INFO L899 garLoopResultBuilder]: For program point L223-1(line 223) no Hoare annotation was computed. [2023-11-23 08:54:50,838 INFO L899 garLoopResultBuilder]: For program point L223-3(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:54:50,839 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 222 224) no Hoare annotation was computed. [2023-11-23 08:54:50,839 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 222 224) the Hoare annotation is: true [2023-11-23 08:54:50,839 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 223) no Hoare annotation was computed. [2023-11-23 08:54:50,846 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 08:54:50,849 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 08:54:50,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:54:50 BoogieIcfgContainer [2023-11-23 08:54:50,855 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 08:54:50,855 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 08:54:50,855 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 08:54:50,856 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 08:54:50,857 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:27" (3/4) ... [2023-11-23 08:54:50,866 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-23 08:54:50,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_next_is_valid [2023-11-23 08:54:50,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure aws_linked_list_node_prev_is_valid [2023-11-23 08:54:50,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-23 08:54:50,869 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-23 08:54:50,875 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2023-11-23 08:54:50,875 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2023-11-23 08:54:50,875 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-23 08:54:50,875 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-23 08:54:50,970 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 08:54:50,971 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2023-11-23 08:54:50,971 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 08:54:50,972 INFO L158 Benchmark]: Toolchain (without parser) took 146393.90ms. Allocated memory was 167.8MB in the beginning and 413.1MB in the end (delta: 245.4MB). Free memory was 102.8MB in the beginning and 335.6MB in the end (delta: -232.8MB). Peak memory consumption was 13.8MB. Max. memory is 16.1GB. [2023-11-23 08:54:50,972 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 08:54:50,973 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1994.76ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 102.8MB in the beginning and 136.6MB in the end (delta: -33.8MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2023-11-23 08:54:50,973 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.37ms. Allocated memory is still 264.2MB. Free memory was 136.6MB in the beginning and 130.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-23 08:54:50,974 INFO L158 Benchmark]: Boogie Preprocessor took 29.60ms. Allocated memory is still 264.2MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 08:54:50,975 INFO L158 Benchmark]: RCFGBuilder took 700.35ms. Allocated memory is still 264.2MB. Free memory was 128.2MB in the beginning and 201.8MB in the end (delta: -73.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2023-11-23 08:54:50,975 INFO L158 Benchmark]: TraceAbstraction took 143432.97ms. Allocated memory was 264.2MB in the beginning and 413.1MB in the end (delta: 148.9MB). Free memory was 200.7MB in the beginning and 340.8MB in the end (delta: -140.1MB). Peak memory consumption was 230.0MB. Max. memory is 16.1GB. [2023-11-23 08:54:50,975 INFO L158 Benchmark]: Witness Printer took 115.43ms. Allocated memory is still 413.1MB. Free memory was 340.8MB in the beginning and 335.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 08:54:50,980 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.49ms. Allocated memory is still 167.8MB. Free memory is still 130.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1994.76ms. Allocated memory was 167.8MB in the beginning and 264.2MB in the end (delta: 96.5MB). Free memory was 102.8MB in the beginning and 136.6MB in the end (delta: -33.8MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.37ms. Allocated memory is still 264.2MB. Free memory was 136.6MB in the beginning and 130.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.60ms. Allocated memory is still 264.2MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 700.35ms. Allocated memory is still 264.2MB. Free memory was 128.2MB in the beginning and 201.8MB in the end (delta: -73.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 143432.97ms. Allocated memory was 264.2MB in the beginning and 413.1MB in the end (delta: 148.9MB). Free memory was 200.7MB in the beginning and 340.8MB in the end (delta: -140.1MB). Peak memory consumption was 230.0MB. Max. memory is 16.1GB. * Witness Printer took 115.43ms. Allocated memory is still 413.1MB. Free memory was 340.8MB in the beginning and 335.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 143.4s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 70.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 11.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 5 mSolverCounterUnknown, 418 SdHoareTripleChecker+Valid, 13.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 358 mSDsluCounter, 3044 SdHoareTripleChecker+Invalid, 13.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1336 IncrementalHoareTripleChecker+Unchecked, 2467 mSDsCounter, 151 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3442 IncrementalHoareTripleChecker+Invalid, 4934 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 151 mSolverCounterUnsat, 577 mSDtfsCounter, 3442 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1301 GetRequests, 883 SyntacticMatches, 80 SemanticMatches, 338 ConstructedPredicates, 11 IntricatePredicates, 1 DeprecatedPredicates, 2592 ImplicationChecksByTransitivity, 97.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=72occurred in iteration=9, InterpolantAutomatonStates: 158, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 27 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 87 PreInvPairs, 98 NumberOfFragments, 1252 HoareAnnotationTreeSize, 87 FomulaSimplifications, 1199 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 16 FomulaSimplificationsInter, 8410 FormulaSimplificationTreeSizeReductionInter, 10.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 56.7s InterpolantComputationTime, 1222 NumberOfCodeBlocks, 1222 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1590 ConstructedInterpolants, 300 QuantifiedInterpolants, 22487 SizeOfPredicates, 190 NumberOfNonLiveVariables, 2730 ConjunctsInSsa, 521 ConjunctsInUnsatCore, 32 InterpolantComputations, 11 PerfectInterpolantSequences, 809/992 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 RESULT: Ultimate proved your program to be correct! [2023-11-23 08:54:51,104 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 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE