./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC --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 5d0330b863a3199999a1d87752dfb6e311192d268b0239668c112b8f01744457 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-6497de0 [2024-11-23 22:35:05,345 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-23 22:35:05,458 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-23 22:35:05,466 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-23 22:35:05,470 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-23 22:35:05,504 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-23 22:35:05,505 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-23 22:35:05,505 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-23 22:35:05,505 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-23 22:35:05,506 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-23 22:35:05,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-23 22:35:05,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-23 22:35:05,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-23 22:35:05,506 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-23 22:35:05,506 INFO L153 SettingsManager]: * Use SBE=true [2024-11-23 22:35:05,507 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-23 22:35:05,507 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-23 22:35:05,508 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-23 22:35:05,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:35:05,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 22:35:05,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:35:05,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:35:05,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-23 22:35:05,508 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-23 22:35:05,508 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-23 22:35:05,508 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-23 22:35:05,508 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:35:05,509 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-23 22:35:05,509 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC 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 -> 5d0330b863a3199999a1d87752dfb6e311192d268b0239668c112b8f01744457 [2024-11-23 22:35:05,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-23 22:35:05,922 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-23 22:35:05,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-23 22:35:05,929 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-23 22:35:05,929 INFO L274 PluginConnector]: CDTParser initialized [2024-11-23 22:35:05,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2024-11-23 22:35:09,314 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/data/8b9d9a4ba/e3442280b31f4bfca695420e0246b50f/FLAG4130d4f4c [2024-11-23 22:35:09,869 INFO L384 CDTParser]: Found 1 translation units. [2024-11-23 22:35:09,871 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i [2024-11-23 22:35:09,905 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/data/8b9d9a4ba/e3442280b31f4bfca695420e0246b50f/FLAG4130d4f4c [2024-11-23 22:35:10,392 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/data/8b9d9a4ba/e3442280b31f4bfca695420e0246b50f [2024-11-23 22:35:10,395 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-23 22:35:10,397 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-23 22:35:10,399 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-23 22:35:10,399 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-23 22:35:10,404 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-23 22:35:10,405 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:10" (1/1) ... [2024-11-23 22:35:10,407 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@381abb6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:10, skipping insertion in model container [2024-11-23 22:35:10,407 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:35:10" (1/1) ... [2024-11-23 22:35:10,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-23 22:35:10,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-23 22:35:10,762 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-23 22:35:11,711 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,714 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,718 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,719 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,721 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,739 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,740 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,743 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,744 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,747 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,748 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,749 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:11,749 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,453 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[150690,150703] [2024-11-23 22:35:12,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:35:12,485 INFO L200 MainTranslator]: Completed pre-run [2024-11-23 22:35:12,507 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4496,4509] [2024-11-23 22:35:12,508 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[4556,4569] [2024-11-23 22:35:12,640 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,644 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,648 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,649 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,649 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,672 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,674 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,679 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,680 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,681 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,686 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,687 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,687 WARN L1675 CHandler]: Possible shadowing of function index [2024-11-23 22:35:12,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/sv-benchmarks/c/aws-c-common/aws_linked_list_rbegin_harness_negated.i[150690,150703] [2024-11-23 22:35:12,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-23 22:35:13,034 INFO L204 MainTranslator]: Completed translation [2024-11-23 22:35:13,035 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13 WrapperNode [2024-11-23 22:35:13,035 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-23 22:35:13,036 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-23 22:35:13,036 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-23 22:35:13,036 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-23 22:35:13,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,101 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,142 INFO L138 Inliner]: procedures = 668, calls = 1039, calls flagged for inlining = 53, calls inlined = 6, statements flattened = 141 [2024-11-23 22:35:13,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-23 22:35:13,143 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-23 22:35:13,143 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-23 22:35:13,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-23 22:35:13,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,158 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,198 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 5, 17]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0]. The 6 writes are split as follows [0, 0, 6]. [2024-11-23 22:35:13,199 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,199 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,221 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,228 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,231 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,233 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-23 22:35:13,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-23 22:35:13,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-23 22:35:13,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-23 22:35:13,240 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (1/1) ... [2024-11-23 22:35:13,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-23 22:35:13,263 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:35:13,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-23 22:35:13,286 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-23 22:35:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-23 22:35:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-23 22:35:13,320 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-23 22:35:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_node_next_is_valid [2024-11-23 22:35:13,320 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_node_next_is_valid [2024-11-23 22:35:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-23 22:35:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure aws_linked_list_is_valid [2024-11-23 22:35:13,320 INFO L138 BoogieDeclarations]: Found implementation of procedure aws_linked_list_is_valid [2024-11-23 22:35:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-23 22:35:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-23 22:35:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-23 22:35:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-23 22:35:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_uint64_t [2024-11-23 22:35:13,322 INFO L138 BoogieDeclarations]: Found implementation of procedure nondet_uint64_t [2024-11-23 22:35:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-23 22:35:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-23 22:35:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-23 22:35:13,595 INFO L234 CfgBuilder]: Building ICFG [2024-11-23 22:35:13,598 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-23 22:35:13,937 INFO L? ?]: Removed 56 outVars from TransFormulas that were not future-live. [2024-11-23 22:35:13,937 INFO L283 CfgBuilder]: Performing block encoding [2024-11-23 22:35:13,948 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-23 22:35:13,949 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-23 22:35:13,949 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:13 BoogieIcfgContainer [2024-11-23 22:35:13,950 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-23 22:35:13,952 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-23 22:35:13,952 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-23 22:35:13,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-23 22:35:13,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:35:10" (1/3) ... [2024-11-23 22:35:13,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a379459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:13, skipping insertion in model container [2024-11-23 22:35:13,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:35:13" (2/3) ... [2024-11-23 22:35:13,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a379459 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:35:13, skipping insertion in model container [2024-11-23 22:35:13,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:13" (3/3) ... [2024-11-23 22:35:13,961 INFO L128 eAbstractionObserver]: Analyzing ICFG aws_linked_list_rbegin_harness_negated.i [2024-11-23 22:35:13,979 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-23 22:35:13,980 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG aws_linked_list_rbegin_harness_negated.i that has 6 procedures, 69 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2024-11-23 22:35:14,050 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-23 22:35:14,064 INFO L333 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, 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;@9d733a0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-23 22:35:14,065 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-23 22:35:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-23 22:35:14,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-23 22:35:14,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:35:14,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:35:14,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:35:14,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:35:14,089 INFO L85 PathProgramCache]: Analyzing trace with hash 324213296, now seen corresponding path program 1 times [2024-11-23 22:35:14,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:35:14,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740599863] [2024-11-23 22:35:14,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:35:14,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:35:14,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:35:14,570 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-23 22:35:14,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:35:14,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740599863] [2024-11-23 22:35:14,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740599863] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:35:14,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [171247863] [2024-11-23 22:35:14,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:35:14,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:35:14,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:35:14,582 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:35:14,590 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-23 22:35:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:35:14,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-23 22:35:14,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:35:14,936 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-23 22:35:14,936 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:35:14,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [171247863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:35:14,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:35:14,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-23 22:35:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766221495] [2024-11-23 22:35:14,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:35:14,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-23 22:35:14,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:35:14,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-23 22:35:14,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 22:35:14,974 INFO L87 Difference]: Start difference. First operand has 69 states, 49 states have (on average 1.346938775510204) internal successors, (66), 50 states have internal predecessors, (66), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:35:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:35:15,013 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2024-11-23 22:35:15,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-23 22:35:15,015 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 68 [2024-11-23 22:35:15,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:35:15,023 INFO L225 Difference]: With dead ends: 130 [2024-11-23 22:35:15,023 INFO L226 Difference]: Without dead ends: 64 [2024-11-23 22:35:15,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-23 22:35:15,032 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:35:15,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:35:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-23 22:35:15,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-23 22:35:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.288888888888889) internal successors, (58), 46 states have internal predecessors, (58), 13 states have call successors, (13), 5 states have call predecessors, (13), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-23 22:35:15,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2024-11-23 22:35:15,082 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 68 [2024-11-23 22:35:15,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:35:15,082 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2024-11-23 22:35:15,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.5) internal successors, (29), 2 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:35:15,083 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2024-11-23 22:35:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-23 22:35:15,086 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:35:15,087 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:35:15,097 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-23 22:35:15,287 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-23 22:35:15,288 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:35:15,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:35:15,288 INFO L85 PathProgramCache]: Analyzing trace with hash -962094674, now seen corresponding path program 1 times [2024-11-23 22:35:15,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:35:15,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949022467] [2024-11-23 22:35:15,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:35:15,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:35:15,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:35:16,432 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-23 22:35:16,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:35:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949022467] [2024-11-23 22:35:16,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949022467] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:35:16,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743886734] [2024-11-23 22:35:16,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:35:16,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:35:16,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:35:16,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:35:16,442 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-23 22:35:16,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:35:16,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-23 22:35:16,747 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:35:16,876 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 18 treesize of output 19 [2024-11-23 22:35:16,903 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 24 treesize of output 9 [2024-11-23 22:35:17,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:35:17,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:35:17,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:35:17,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-23 22:35:17,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:35:17,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:35:17,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2024-11-23 22:35:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-23 22:35:19,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:35:19,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743886734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:35:19,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:35:19,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2024-11-23 22:35:19,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468896692] [2024-11-23 22:35:19,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:35:19,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-23 22:35:19,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:35:19,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-23 22:35:19,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-23 22:35:19,972 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-23 22:35:21,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:35:21,191 INFO L93 Difference]: Finished difference Result 174 states and 234 transitions. [2024-11-23 22:35:21,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-23 22:35:21,192 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-23 22:35:21,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:35:21,195 INFO L225 Difference]: With dead ends: 174 [2024-11-23 22:35:21,195 INFO L226 Difference]: Without dead ends: 122 [2024-11-23 22:35:21,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 53 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-23 22:35:21,197 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 22:35:21,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 446 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-23 22:35:21,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-11-23 22:35:21,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 117. [2024-11-23 22:35:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 83 states have (on average 1.3132530120481927) internal successors, (109), 85 states have internal predecessors, (109), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-23 22:35:21,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 155 transitions. [2024-11-23 22:35:21,245 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 155 transitions. Word has length 68 [2024-11-23 22:35:21,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:35:21,245 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 155 transitions. [2024-11-23 22:35:21,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 4 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-23 22:35:21,246 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 155 transitions. [2024-11-23 22:35:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-23 22:35:21,252 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:35:21,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:35:21,267 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-23 22:35:21,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:35:21,456 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:35:21,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:35:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash 536177768, now seen corresponding path program 1 times [2024-11-23 22:35:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:35:21,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905407395] [2024-11-23 22:35:21,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:35:21,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:35:21,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:35:22,088 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-23 22:35:22,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:35:22,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905407395] [2024-11-23 22:35:22,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905407395] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:35:22,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689353794] [2024-11-23 22:35:22,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:35:22,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:35:22,090 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:35:22,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:35:22,097 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-23 22:35:22,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:35:22,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-23 22:35:22,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:35:22,529 INFO L349 Elim1Store]: treesize reduction 66, result has 39.4 percent of original size [2024-11-23 22:35:22,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 128 [2024-11-23 22:35:22,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2024-11-23 22:35:22,565 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:35:22,566 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2024-11-23 22:35:22,631 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:35:22,632 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 13 [2024-11-23 22:35:22,636 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 13 treesize of output 9 [2024-11-23 22:35:45,721 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse3 .cse5 .cse4)) .cse4)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse4))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))))) is different from true [2024-11-23 22:35:54,476 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse5))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse3 (select |c_#memory_$Pointer$#2.base| .cse4))) (= .cse3 (select (store (store |c_#memory_$Pointer$#2.base| .cse4 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse3 .cse5 .cse4)) .cse4)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse4))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse6 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| .cse6))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse6 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| (store .cse7 .cse8 .cse6)) .cse6) .cse7))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse6))))))))) is different from true [2024-11-23 22:35:55,327 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset| 24))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) .cse2))) (and (or (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse0 (select |c_#memory_$Pointer$#2.base| .cse1))) (= .cse0 (select (store (store |c_#memory_$Pointer$#2.base| .cse1 v_DerPreprocessor_1) |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| (store .cse0 .cse2 .cse1)) .cse1)))) (= .cse1 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|)) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse4 .cse5 .cse3)) .cse3) .cse4))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (<= 2 |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base|) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse9)))))))) (<= |c_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base| .cse1)))) is different from true [2024-11-23 22:35:55,508 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| (store .cse4 .cse5 .cse3)) .cse3))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse11))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| (store .cse10 .cse11 .cse9)) .cse9) .cse10))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse9))))))))) is different from true [2024-11-23 22:36:00,525 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) .cse2))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| .cse0) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse1 (select |c_#memory_$Pointer$#2.base| .cse0))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse0 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (store .cse1 .cse2 .cse0)) .cse0) .cse1))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_7|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_7| 24))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_5| 24))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5|) .cse5))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| .cse3) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| .cse3))) (= .cse4 (select (store (store |c_#memory_$Pointer$#2.base| .cse3 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_5| (store .cse4 .cse5 .cse3)) .cse3))))))))))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) .cse8))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse6 (select |c_#memory_$Pointer$#2.base| .cse7))) (= .cse6 (select (store (store |c_#memory_$Pointer$#2.base| .cse7 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (store .cse6 .cse8 .cse7)) .cse7)))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| .cse7))))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| Int)) (= |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8| (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset_BEFORE_CALL_8| 24)))) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_8|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_6| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_6| 24))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|) .cse11))) (and (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6| .cse9) (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse10 (select |c_#memory_$Pointer$#2.base| .cse9))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse9 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6| (store .cse10 .cse11 .cse9)) .cse9) .cse10))))))))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_6| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_6|)))) (or (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (= (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24)) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|)) (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|))) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| Int)) (and (<= 2 |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| Int)) (let ((.cse14 (+ |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.offset_BEFORE_CALL_4| 24))) (let ((.cse12 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4|) .cse14))) (and (exists ((v_DerPreprocessor_1 (Array Int Int))) (let ((.cse13 (select |c_#memory_$Pointer$#2.base| .cse12))) (= (select (store (store |c_#memory_$Pointer$#2.base| .cse12 v_DerPreprocessor_1) |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| (store .cse13 .cse14 .cse12)) .cse12) .cse13))) (<= |v_ULTIMATE.start_aws_linked_list_rbegin_~list#1.base_BEFORE_CALL_4| .cse12))))))))) is different from true [2024-11-23 22:36:03,554 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 27 not checked. [2024-11-23 22:36:03,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:36:08,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:36:08,185 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 238 treesize of output 232 [2024-11-23 22:36:08,195 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 162 treesize of output 146 [2024-11-23 22:36:08,257 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 129 treesize of output 117 [2024-11-23 22:36:20,798 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:36:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689353794] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-23 22:36:20,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-23 22:36:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6, 20] total 33 [2024-11-23 22:36:20,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137519389] [2024-11-23 22:36:20,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:36:20,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 22:36:20,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:36:20,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 22:36:20,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=643, Unknown=36, NotChecked=280, Total=1056 [2024-11-23 22:36:20,801 INFO L87 Difference]: Start difference. First operand 117 states and 155 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-23 22:36:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:36:29,714 INFO L93 Difference]: Finished difference Result 197 states and 277 transitions. [2024-11-23 22:36:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-23 22:36:29,715 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 68 [2024-11-23 22:36:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:36:29,717 INFO L225 Difference]: With dead ends: 197 [2024-11-23 22:36:29,718 INFO L226 Difference]: Without dead ends: 136 [2024-11-23 22:36:29,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 62.4s TimeCoverageRelationStatistics Valid=143, Invalid=1098, Unknown=39, NotChecked=360, Total=1640 [2024-11-23 22:36:29,725 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 156 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-23 22:36:29,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 421 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-23 22:36:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-23 22:36:29,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 119. [2024-11-23 22:36:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 85 states have (on average 1.3058823529411765) internal successors, (111), 87 states have internal predecessors, (111), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-23 22:36:29,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 157 transitions. [2024-11-23 22:36:29,771 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 157 transitions. Word has length 68 [2024-11-23 22:36:29,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:36:29,771 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 157 transitions. [2024-11-23 22:36:29,772 INFO L472 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, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-23 22:36:29,772 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 157 transitions. [2024-11-23 22:36:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-23 22:36:29,778 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:36:29,778 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:36:29,792 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-23 22:36:29,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-23 22:36:29,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:36:29,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:36:29,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1561950370, now seen corresponding path program 1 times [2024-11-23 22:36:29,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:36:29,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631995499] [2024-11-23 22:36:29,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:29,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:36:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:30,515 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2024-11-23 22:36:30,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:36:30,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631995499] [2024-11-23 22:36:30,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631995499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:36:30,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:36:30,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-23 22:36:30,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061421891] [2024-11-23 22:36:30,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:36:30,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:36:30,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:36:30,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:36:30,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-23 22:36:30,517 INFO L87 Difference]: Start difference. First operand 119 states and 157 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-23 22:36:30,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:36:30,591 INFO L93 Difference]: Finished difference Result 137 states and 182 transitions. [2024-11-23 22:36:30,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 22:36:30,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 68 [2024-11-23 22:36:30,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:36:30,594 INFO L225 Difference]: With dead ends: 137 [2024-11-23 22:36:30,594 INFO L226 Difference]: Without dead ends: 135 [2024-11-23 22:36:30,595 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:36:30,595 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 3 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:36:30,596 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 392 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:36:30,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-23 22:36:30,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-11-23 22:36:30,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.2795698924731183) internal successors, (119), 97 states have internal predecessors, (119), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-23 22:36:30,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2024-11-23 22:36:30,621 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 68 [2024-11-23 22:36:30,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:36:30,622 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2024-11-23 22:36:30,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2024-11-23 22:36:30,622 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2024-11-23 22:36:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-23 22:36:30,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:36:30,625 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-23 22:36:30,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-23 22:36:30,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:36:30,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:36:30,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1823129154, now seen corresponding path program 1 times [2024-11-23 22:36:30,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:36:30,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012878293] [2024-11-23 22:36:30,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:36:30,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:30,937 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:36:30,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:36:30,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012878293] [2024-11-23 22:36:30,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012878293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:36:30,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:36:30,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:36:30,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499356513] [2024-11-23 22:36:30,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:36:30,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:36:30,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:36:30,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:36:30,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:36:30,939 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:36:31,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:36:31,118 INFO L93 Difference]: Finished difference Result 258 states and 345 transitions. [2024-11-23 22:36:31,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:36:31,119 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 70 [2024-11-23 22:36:31,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:36:31,121 INFO L225 Difference]: With dead ends: 258 [2024-11-23 22:36:31,122 INFO L226 Difference]: Without dead ends: 137 [2024-11-23 22:36:31,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-23 22:36:31,124 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 21 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:36:31,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 354 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:36:31,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-23 22:36:31,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 133. [2024-11-23 22:36:31,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 93 states have (on average 1.2580645161290323) internal successors, (117), 97 states have internal predecessors, (117), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-23 22:36:31,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 175 transitions. [2024-11-23 22:36:31,152 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 175 transitions. Word has length 70 [2024-11-23 22:36:31,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:36:31,155 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 175 transitions. [2024-11-23 22:36:31,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:36:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 175 transitions. [2024-11-23 22:36:31,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-23 22:36:31,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:36:31,162 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2024-11-23 22:36:31,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-23 22:36:31,162 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:36:31,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:36:31,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1713818576, now seen corresponding path program 1 times [2024-11-23 22:36:31,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:36:31,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614767110] [2024-11-23 22:36:31,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:31,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:36:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:31,498 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:36:31,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:36:31,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614767110] [2024-11-23 22:36:31,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614767110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:36:31,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:36:31,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 22:36:31,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969026490] [2024-11-23 22:36:31,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:36:31,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 22:36:31,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:36:31,500 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 22:36:31,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-23 22:36:31,501 INFO L87 Difference]: Start difference. First operand 133 states and 175 transitions. Second operand has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:36:31,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:36:31,723 INFO L93 Difference]: Finished difference Result 270 states and 361 transitions. [2024-11-23 22:36:31,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-23 22:36:31,724 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 72 [2024-11-23 22:36:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:36:31,726 INFO L225 Difference]: With dead ends: 270 [2024-11-23 22:36:31,727 INFO L226 Difference]: Without dead ends: 147 [2024-11-23 22:36:31,728 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-23 22:36:31,729 INFO L435 NwaCegarLoop]: 65 mSDtfsCounter, 30 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 22:36:31,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 399 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 22:36:31,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-23 22:36:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 135. [2024-11-23 22:36:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 95 states have (on average 1.2526315789473683) internal successors, (119), 99 states have internal predecessors, (119), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-23 22:36:31,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 177 transitions. [2024-11-23 22:36:31,764 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 177 transitions. Word has length 72 [2024-11-23 22:36:31,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:36:31,764 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 177 transitions. [2024-11-23 22:36:31,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.125) internal successors, (41), 8 states have internal predecessors, (41), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:36:31,765 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 177 transitions. [2024-11-23 22:36:31,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-23 22:36:31,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:36:31,767 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1] [2024-11-23 22:36:31,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-23 22:36:31,767 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:36:31,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:36:31,768 INFO L85 PathProgramCache]: Analyzing trace with hash 831638789, now seen corresponding path program 1 times [2024-11-23 22:36:31,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:36:31,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622561789] [2024-11-23 22:36:31,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:31,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:36:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:32,241 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:36:32,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:36:32,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622561789] [2024-11-23 22:36:32,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622561789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:36:32,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:36:32,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-23 22:36:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312448378] [2024-11-23 22:36:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:36:32,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-23 22:36:32,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:36:32,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-23 22:36:32,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-23 22:36:32,245 INFO L87 Difference]: Start difference. First operand 135 states and 177 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:36:32,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:36:32,494 INFO L93 Difference]: Finished difference Result 272 states and 361 transitions. [2024-11-23 22:36:32,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-23 22:36:32,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 73 [2024-11-23 22:36:32,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:36:32,497 INFO L225 Difference]: With dead ends: 272 [2024-11-23 22:36:32,498 INFO L226 Difference]: Without dead ends: 147 [2024-11-23 22:36:32,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-23 22:36:32,499 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-23 22:36:32,500 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 406 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-23 22:36:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-23 22:36:32,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 137. [2024-11-23 22:36:32,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 97 states have (on average 1.2474226804123711) internal successors, (121), 101 states have internal predecessors, (121), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-23 22:36:32,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 179 transitions. [2024-11-23 22:36:32,583 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 179 transitions. Word has length 73 [2024-11-23 22:36:32,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:36:32,584 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 179 transitions. [2024-11-23 22:36:32,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 3 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-23 22:36:32,584 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 179 transitions. [2024-11-23 22:36:32,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-23 22:36:32,589 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:36:32,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:36:32,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-23 22:36:32,589 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:36:32,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:36:32,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1979775390, now seen corresponding path program 1 times [2024-11-23 22:36:32,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:36:32,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279738181] [2024-11-23 22:36:32,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:32,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:36:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:33,019 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2024-11-23 22:36:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:36:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279738181] [2024-11-23 22:36:33,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279738181] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:36:33,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833577161] [2024-11-23 22:36:33,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:33,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:36:33,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:36:33,023 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:36:33,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-23 22:36:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:33,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-23 22:36:33,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:36:33,335 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 24 treesize of output 9 [2024-11-23 22:36:33,344 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 18 treesize of output 19 [2024-11-23 22:36:33,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:33,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:33,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:33,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 25 [2024-11-23 22:36:33,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:33,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:33,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 35 [2024-11-23 22:36:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-23 22:36:35,802 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:36:35,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833577161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:36:35,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:36:35,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2024-11-23 22:36:35,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443472044] [2024-11-23 22:36:35,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:36:35,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-23 22:36:35,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:36:35,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-23 22:36:35,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-23 22:36:35,805 INFO L87 Difference]: Start difference. First operand 137 states and 179 transitions. Second operand has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-23 22:36:37,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:36:37,055 INFO L93 Difference]: Finished difference Result 221 states and 292 transitions. [2024-11-23 22:36:37,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 22:36:37,055 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2024-11-23 22:36:37,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:36:37,057 INFO L225 Difference]: With dead ends: 221 [2024-11-23 22:36:37,058 INFO L226 Difference]: Without dead ends: 142 [2024-11-23 22:36:37,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 58 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2024-11-23 22:36:37,060 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 79 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 471 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-23 22:36:37,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 471 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-23 22:36:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-23 22:36:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 139. [2024-11-23 22:36:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 99 states have (on average 1.2424242424242424) internal successors, (123), 103 states have internal predecessors, (123), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-23 22:36:37,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 181 transitions. [2024-11-23 22:36:37,102 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 181 transitions. Word has length 74 [2024-11-23 22:36:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:36:37,102 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 181 transitions. [2024-11-23 22:36:37,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.909090909090909) internal successors, (43), 11 states have internal predecessors, (43), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-23 22:36:37,103 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 181 transitions. [2024-11-23 22:36:37,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-23 22:36:37,106 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:36:37,106 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:36:37,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-23 22:36:37,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:36:37,307 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:36:37,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:36:37,308 INFO L85 PathProgramCache]: Analyzing trace with hash 802699420, now seen corresponding path program 1 times [2024-11-23 22:36:37,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:36:37,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448509757] [2024-11-23 22:36:37,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:37,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:36:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:38,106 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:36:38,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:36:38,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448509757] [2024-11-23 22:36:38,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448509757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:36:38,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789782111] [2024-11-23 22:36:38,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:38,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:36:38,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:36:38,109 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:36:38,112 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-23 22:36:38,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:38,307 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-23 22:36:38,311 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:36:38,477 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 14 treesize of output 15 [2024-11-23 22:36:39,517 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 22:36:39,517 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:36:39,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789782111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:36:39,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:36:39,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 19 [2024-11-23 22:36:39,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996623428] [2024-11-23 22:36:39,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:36:39,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-23 22:36:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:36:39,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-23 22:36:39,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-23 22:36:39,519 INFO L87 Difference]: Start difference. First operand 139 states and 181 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-23 22:36:43,659 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:36:47,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:36:51,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:36:55,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:36:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:36:56,659 INFO L93 Difference]: Finished difference Result 229 states and 301 transitions. [2024-11-23 22:36:56,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-23 22:36:56,660 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) Word has length 74 [2024-11-23 22:36:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:36:56,661 INFO L225 Difference]: With dead ends: 229 [2024-11-23 22:36:56,662 INFO L226 Difference]: Without dead ends: 144 [2024-11-23 22:36:56,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 4 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2024-11-23 22:36:56,663 INFO L435 NwaCegarLoop]: 67 mSDtfsCounter, 202 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 55 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 502 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.8s IncrementalHoareTripleChecker+Time [2024-11-23 22:36:56,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 502 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 337 Invalid, 4 Unknown, 0 Unchecked, 16.8s Time] [2024-11-23 22:36:56,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-23 22:36:56,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-11-23 22:36:56,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 101 states have (on average 1.2376237623762376) internal successors, (125), 105 states have internal predecessors, (125), 26 states have call successors, (26), 11 states have call predecessors, (26), 13 states have return successors, (32), 24 states have call predecessors, (32), 24 states have call successors, (32) [2024-11-23 22:36:56,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2024-11-23 22:36:56,687 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 74 [2024-11-23 22:36:56,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:36:56,687 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2024-11-23 22:36:56,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 12 states have internal predecessors, (56), 4 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 3 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-23 22:36:56,688 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2024-11-23 22:36:56,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-23 22:36:56,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:36:56,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:36:56,699 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-23 22:36:56,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:36:56,893 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:36:56,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:36:56,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1003633578, now seen corresponding path program 1 times [2024-11-23 22:36:56,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:36:56,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372271424] [2024-11-23 22:36:56,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:56,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:36:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:36:57,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:36:57,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372271424] [2024-11-23 22:36:57,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372271424] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:36:57,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402695927] [2024-11-23 22:36:57,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:57,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:36:57,050 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:36:57,052 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:36:57,055 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-23 22:36:57,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:57,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-23 22:36:57,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:36:57,374 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-23 22:36:57,375 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:36:57,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402695927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:36:57,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:36:57,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2024-11-23 22:36:57,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404030044] [2024-11-23 22:36:57,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:36:57,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-23 22:36:57,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:36:57,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-23 22:36:57,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-23 22:36:57,379 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-23 22:36:57,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:36:57,589 INFO L93 Difference]: Finished difference Result 300 states and 398 transitions. [2024-11-23 22:36:57,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-23 22:36:57,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 74 [2024-11-23 22:36:57,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:36:57,591 INFO L225 Difference]: With dead ends: 300 [2024-11-23 22:36:57,592 INFO L226 Difference]: Without dead ends: 177 [2024-11-23 22:36:57,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-23 22:36:57,597 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 102 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:36:57,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 259 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:36:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-23 22:36:57,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-23 22:36:57,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 132 states have (on average 1.2575757575757576) internal successors, (166), 139 states have internal predecessors, (166), 28 states have call successors, (28), 11 states have call predecessors, (28), 16 states have return successors, (38), 26 states have call predecessors, (38), 26 states have call successors, (38) [2024-11-23 22:36:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 232 transitions. [2024-11-23 22:36:57,636 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 232 transitions. Word has length 74 [2024-11-23 22:36:57,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:36:57,638 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 232 transitions. [2024-11-23 22:36:57,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2024-11-23 22:36:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 232 transitions. [2024-11-23 22:36:57,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-23 22:36:57,641 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:36:57,641 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:36:57,654 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-23 22:36:57,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-23 22:36:57,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:36:57,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:36:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash 533903658, now seen corresponding path program 1 times [2024-11-23 22:36:57,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:36:57,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358748893] [2024-11-23 22:36:57,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:57,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:36:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:58,250 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 22:36:58,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:36:58,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358748893] [2024-11-23 22:36:58,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358748893] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:36:58,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494458890] [2024-11-23 22:36:58,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:36:58,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:36:58,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:36:58,253 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:36:58,257 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-23 22:36:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:36:58,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-23 22:36:58,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:36:58,601 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 24 treesize of output 9 [2024-11-23 22:36:58,615 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 18 treesize of output 19 [2024-11-23 22:36:58,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 40 [2024-11-23 22:36:58,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,741 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 27 treesize of output 20 [2024-11-23 22:36:58,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,755 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-11-23 22:36:58,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,764 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 25 treesize of output 18 [2024-11-23 22:36:58,927 INFO L349 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2024-11-23 22:36:58,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 116 treesize of output 120 [2024-11-23 22:36:58,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2024-11-23 22:36:58,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,954 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 45 treesize of output 40 [2024-11-23 22:36:58,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2024-11-23 22:36:58,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:36:58,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 22 [2024-11-23 22:37:01,569 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-23 22:37:01,570 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:37:02,247 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24)) (.cse2 (+ 16 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|))) (and (forall ((v_ArrVal_643 Int)) (or (forall ((v_ArrVal_646 (Array Int Int))) (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_643)) v_ArrVal_643 v_ArrVal_646))) (store .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse0 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_ArrVal_643))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_643 1)))) (forall ((v_ArrVal_643 Int)) (or (forall ((v_ArrVal_648 (Array Int Int)) (v_subst_1 Int) (v_ArrVal_644 Int)) (= (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|) |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset| v_ArrVal_644)) v_ArrVal_643 v_ArrVal_648))) (store .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse1 v_subst_1))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse2) 0)) (< |c_#StackHeapBarrier| (+ v_ArrVal_643 1)))))) is different from false [2024-11-23 22:37:02,290 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:37:02,291 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:37:02,402 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-23 22:37:02,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 297 treesize of output 284 [2024-11-23 22:37:02,421 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:37:02,422 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:37:02,506 INFO L349 Elim1Store]: treesize reduction 86, result has 45.2 percent of original size [2024-11-23 22:37:02,506 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 363 treesize of output 350 [2024-11-23 22:37:02,535 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:02,535 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 296 treesize of output 294 [2024-11-23 22:37:02,556 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 253 treesize of output 241 [2024-11-23 22:37:02,585 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:02,585 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 348 treesize of output 322 [2024-11-23 22:37:02,604 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 289 treesize of output 277 [2024-11-23 22:37:02,637 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 8 treesize of output 4 [2024-11-23 22:37:03,824 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 7 treesize of output 3 [2024-11-23 22:37:03,867 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-23 22:37:03,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:03,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 68 treesize of output 74 [2024-11-23 22:37:04,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-23 22:37:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 1 not checked. [2024-11-23 22:37:04,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494458890] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:37:04,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:37:04,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 23 [2024-11-23 22:37:04,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510547718] [2024-11-23 22:37:04,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:37:04,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-23 22:37:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:37:04,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-23 22:37:04,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=394, Unknown=9, NotChecked=40, Total=506 [2024-11-23 22:37:04,148 INFO L87 Difference]: Start difference. First operand 177 states and 232 transitions. Second operand has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-23 22:37:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:37:07,819 INFO L93 Difference]: Finished difference Result 355 states and 481 transitions. [2024-11-23 22:37:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-23 22:37:07,820 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) Word has length 76 [2024-11-23 22:37:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:37:07,822 INFO L225 Difference]: With dead ends: 355 [2024-11-23 22:37:07,822 INFO L226 Difference]: Without dead ends: 266 [2024-11-23 22:37:07,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 126 SyntacticMatches, 10 SemanticMatches, 35 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=154, Invalid=1098, Unknown=12, NotChecked=68, Total=1332 [2024-11-23 22:37:07,825 INFO L435 NwaCegarLoop]: 108 mSDtfsCounter, 73 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 32 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-23 22:37:07,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1228 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 750 Invalid, 2 Unknown, 148 Unchecked, 2.6s Time] [2024-11-23 22:37:07,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-23 22:37:07,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 263. [2024-11-23 22:37:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 197 states have (on average 1.2690355329949239) internal successors, (250), 208 states have internal predecessors, (250), 41 states have call successors, (41), 16 states have call predecessors, (41), 24 states have return successors, (56), 38 states have call predecessors, (56), 38 states have call successors, (56) [2024-11-23 22:37:07,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 347 transitions. [2024-11-23 22:37:07,873 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 347 transitions. Word has length 76 [2024-11-23 22:37:07,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:37:07,873 INFO L471 AbstractCegarLoop]: Abstraction has 263 states and 347 transitions. [2024-11-23 22:37:07,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 4.2272727272727275) internal successors, (93), 22 states have internal predecessors, (93), 9 states have call successors, (24), 3 states have call predecessors, (24), 7 states have return successors, (23), 9 states have call predecessors, (23), 9 states have call successors, (23) [2024-11-23 22:37:07,874 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 347 transitions. [2024-11-23 22:37:07,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-23 22:37:07,876 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:37:07,876 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:37:07,889 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-23 22:37:08,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:37:08,080 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:37:08,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:37:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -219961707, now seen corresponding path program 1 times [2024-11-23 22:37:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:37:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456585090] [2024-11-23 22:37:08,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:37:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:37:08,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:37:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:37:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:37:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456585090] [2024-11-23 22:37:08,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456585090] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:37:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23027207] [2024-11-23 22:37:08,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:37:08,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:37:08,290 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:37:08,292 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:37:08,297 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-23 22:37:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:37:08,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-23 22:37:08,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:37:08,657 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-23 22:37:08,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:37:08,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [23027207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:37:08,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:37:08,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2024-11-23 22:37:08,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487469770] [2024-11-23 22:37:08,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:37:08,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:37:08,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:37:08,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:37:08,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-23 22:37:08,660 INFO L87 Difference]: Start difference. First operand 263 states and 347 transitions. Second operand has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-23 22:37:08,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:37:08,902 INFO L93 Difference]: Finished difference Result 489 states and 636 transitions. [2024-11-23 22:37:08,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:37:08,902 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 87 [2024-11-23 22:37:08,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:37:08,904 INFO L225 Difference]: With dead ends: 489 [2024-11-23 22:37:08,905 INFO L226 Difference]: Without dead ends: 191 [2024-11-23 22:37:08,907 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-23 22:37:08,907 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 96 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-23 22:37:08,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 347 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-23 22:37:08,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-23 22:37:09,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-11-23 22:37:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 136 states have (on average 1.213235294117647) internal successors, (165), 141 states have internal predecessors, (165), 37 states have call successors, (37), 15 states have call predecessors, (37), 17 states have return successors, (40), 34 states have call predecessors, (40), 34 states have call successors, (40) [2024-11-23 22:37:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 242 transitions. [2024-11-23 22:37:09,018 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 242 transitions. Word has length 87 [2024-11-23 22:37:09,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:37:09,018 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 242 transitions. [2024-11-23 22:37:09,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.666666666666666) internal successors, (64), 7 states have internal predecessors, (64), 4 states have call successors, (10), 2 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-23 22:37:09,019 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 242 transitions. [2024-11-23 22:37:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-23 22:37:09,021 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:37:09,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:37:09,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-23 22:37:09,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-23 22:37:09,224 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:37:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:37:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 2123239013, now seen corresponding path program 1 times [2024-11-23 22:37:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:37:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779840243] [2024-11-23 22:37:09,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:37:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:37:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:37:09,716 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-23 22:37:09,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:37:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779840243] [2024-11-23 22:37:09,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779840243] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:37:09,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470256983] [2024-11-23 22:37:09,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:37:09,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:37:09,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:37:09,720 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:37:09,725 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-23 22:37:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:37:10,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-23 22:37:10,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:37:10,192 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 16 treesize of output 16 [2024-11-23 22:37:10,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:37:10,205 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 16 treesize of output 11 [2024-11-23 22:37:10,215 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 16 treesize of output 16 [2024-11-23 22:37:10,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:37:10,223 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 16 treesize of output 11 [2024-11-23 22:37:10,327 INFO L349 Elim1Store]: treesize reduction 38, result has 22.4 percent of original size [2024-11-23 22:37:10,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 101 [2024-11-23 22:37:10,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:37:10,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:37:10,336 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 24 treesize of output 21 [2024-11-23 22:37:10,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 72 treesize of output 58 [2024-11-23 22:37:10,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 18 [2024-11-23 22:37:18,929 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 24 proven. 15 refuted. 7 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-23 22:37:18,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:37:20,305 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset| 24)) (.cse3 (+ |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.offset| 24))) (and (forall ((v_ArrVal_820 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_820))) (store .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse2 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|))) (or (= (select .cse0 |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0) (not (= (select .cse0 .cse1) 0))))) (or (forall ((v_ArrVal_820 (Array Int Int))) (not (= (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_820))) (store .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse4 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) .cse1) 0))) (forall ((v_ArrVal_819 (Array Int Int))) (= (select (select (let ((.cse5 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.base| v_ArrVal_819))) (store .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base| (store (select .cse5 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~list#1.base|) .cse3 |c_ULTIMATE.start_ensure_linked_list_is_allocated_~curr~0#1.offset|))) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base|) |c_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.offset|) 0))))) is different from false [2024-11-23 22:37:20,360 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:20,361 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 1 case distinctions, treesize of input 165 treesize of output 126 [2024-11-23 22:37:20,374 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:20,374 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 1 case distinctions, treesize of input 161 treesize of output 154 [2024-11-23 22:37:20,416 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:20,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1309 treesize of output 1123 [2024-11-23 22:37:20,448 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 569 treesize of output 553 [2024-11-23 22:37:20,502 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:20,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 684 treesize of output 698 [2024-11-23 22:37:20,529 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 683 treesize of output 675 [2024-11-23 22:37:20,576 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:20,577 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 703 treesize of output 679 [2024-11-23 22:37:21,130 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 6 treesize of output 4 [2024-11-23 22:37:21,204 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 6 treesize of output 4 [2024-11-23 22:37:21,222 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:21,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 111 treesize of output 115 [2024-11-23 22:37:21,368 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:21,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 297 treesize of output 297 [2024-11-23 22:37:22,244 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 8 treesize of output 4 [2024-11-23 22:37:22,253 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 24 treesize of output 20 [2024-11-23 22:37:22,265 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 24 treesize of output 20 [2024-11-23 22:37:22,365 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 8 treesize of output 4 [2024-11-23 22:37:22,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:37:22,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 205 treesize of output 183 [2024-11-23 22:37:23,449 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 15 trivial. 1 not checked. [2024-11-23 22:37:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470256983] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:37:23,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:37:23,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 28, 16] total 47 [2024-11-23 22:37:23,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133811548] [2024-11-23 22:37:23,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:37:23,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-23 22:37:23,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:37:23,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-23 22:37:23,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1805, Unknown=83, NotChecked=88, Total=2162 [2024-11-23 22:37:23,454 INFO L87 Difference]: Start difference. First operand 191 states and 242 transitions. Second operand has 47 states, 42 states have (on average 3.357142857142857) internal successors, (141), 41 states have internal predecessors, (141), 14 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-23 22:37:56,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:37:56,052 INFO L93 Difference]: Finished difference Result 687 states and 971 transitions. [2024-11-23 22:37:56,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2024-11-23 22:37:56,053 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 42 states have (on average 3.357142857142857) internal successors, (141), 41 states have internal predecessors, (141), 14 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) Word has length 89 [2024-11-23 22:37:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:37:56,058 INFO L225 Difference]: With dead ends: 687 [2024-11-23 22:37:56,058 INFO L226 Difference]: Without dead ends: 462 [2024-11-23 22:37:56,065 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5578 ImplicationChecksByTransitivity, 22.8s TimeCoverageRelationStatistics Valid=1846, Invalid=17829, Unknown=635, NotChecked=282, Total=20592 [2024-11-23 22:37:56,066 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 490 mSDsluCounter, 1965 mSDsCounter, 0 mSdLazyCounter, 3285 mSolverCounterSat, 128 mSolverCounterUnsat, 1520 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 5393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 3285 IncrementalHoareTripleChecker+Invalid, 1520 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-23 22:37:56,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2067 Invalid, 5393 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [128 Valid, 3285 Invalid, 1520 Unknown, 460 Unchecked, 15.4s Time] [2024-11-23 22:37:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-23 22:37:56,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 350. [2024-11-23 22:37:56,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 268 states have (on average 1.2649253731343284) internal successors, (339), 282 states have internal predecessors, (339), 48 states have call successors, (48), 22 states have call predecessors, (48), 33 states have return successors, (89), 45 states have call predecessors, (89), 45 states have call successors, (89) [2024-11-23 22:37:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 476 transitions. [2024-11-23 22:37:56,195 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 476 transitions. Word has length 89 [2024-11-23 22:37:56,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:37:56,195 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 476 transitions. [2024-11-23 22:37:56,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 42 states have (on average 3.357142857142857) internal successors, (141), 41 states have internal predecessors, (141), 14 states have call successors, (26), 7 states have call predecessors, (26), 11 states have return successors, (25), 12 states have call predecessors, (25), 14 states have call successors, (25) [2024-11-23 22:37:56,195 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 476 transitions. [2024-11-23 22:37:56,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-23 22:37:56,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:37:56,200 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:37:56,215 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-23 22:37:56,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:37:56,404 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:37:56,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:37:56,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1442601617, now seen corresponding path program 1 times [2024-11-23 22:37:56,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:37:56,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117755330] [2024-11-23 22:37:56,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:37:56,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:37:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:37:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-23 22:37:56,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:37:56,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117755330] [2024-11-23 22:37:56,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117755330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:37:56,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [652462020] [2024-11-23 22:37:56,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:37:56,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:37:56,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:37:56,949 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:37:56,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-23 22:37:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:37:57,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-11-23 22:37:57,246 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:37:57,303 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-23 22:37:57,305 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-23 22:37:57,979 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-23 22:37:57,979 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:37:58,682 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 31 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-23 22:37:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [652462020] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:37:58,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:37:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 16, 13] total 32 [2024-11-23 22:37:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939968472] [2024-11-23 22:37:58,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:37:58,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-23 22:37:58,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:37:58,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-23 22:37:58,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-23 22:37:58,685 INFO L87 Difference]: Start difference. First operand 350 states and 476 transitions. Second operand has 32 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-23 22:38:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:38:00,902 INFO L93 Difference]: Finished difference Result 1052 states and 1482 transitions. [2024-11-23 22:38:00,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-23 22:38:00,902 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) Word has length 91 [2024-11-23 22:38:00,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:38:00,909 INFO L225 Difference]: With dead ends: 1052 [2024-11-23 22:38:00,909 INFO L226 Difference]: Without dead ends: 743 [2024-11-23 22:38:00,912 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 163 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=372, Invalid=2708, Unknown=0, NotChecked=0, Total=3080 [2024-11-23 22:38:00,912 INFO L435 NwaCegarLoop]: 84 mSDtfsCounter, 332 mSDsluCounter, 1112 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 1343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-23 22:38:00,913 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 1196 Invalid, 1343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-23 22:38:00,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2024-11-23 22:38:01,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 631. [2024-11-23 22:38:01,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 631 states, 485 states have (on average 1.2577319587628866) internal successors, (610), 509 states have internal predecessors, (610), 87 states have call successors, (87), 37 states have call predecessors, (87), 58 states have return successors, (147), 84 states have call predecessors, (147), 82 states have call successors, (147) [2024-11-23 22:38:01,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 844 transitions. [2024-11-23 22:38:01,046 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 844 transitions. Word has length 91 [2024-11-23 22:38:01,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:38:01,046 INFO L471 AbstractCegarLoop]: Abstraction has 631 states and 844 transitions. [2024-11-23 22:38:01,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 4.433333333333334) internal successors, (133), 30 states have internal predecessors, (133), 11 states have call successors, (22), 3 states have call predecessors, (22), 6 states have return successors, (22), 8 states have call predecessors, (22), 11 states have call successors, (22) [2024-11-23 22:38:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 844 transitions. [2024-11-23 22:38:01,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-23 22:38:01,054 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:38:01,054 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:38:01,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-23 22:38:01,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:38:01,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:38:01,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:38:01,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1058687631, now seen corresponding path program 1 times [2024-11-23 22:38:01,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:38:01,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088404459] [2024-11-23 22:38:01,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:38:01,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:38:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:38:01,363 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-23 22:38:01,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:38:01,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088404459] [2024-11-23 22:38:01,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088404459] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:38:01,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106699215] [2024-11-23 22:38:01,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:38:01,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:38:01,364 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:38:01,366 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:38:01,369 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-23 22:38:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:38:01,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 22:38:01,681 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:38:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2024-11-23 22:38:01,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:38:01,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106699215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:38:01,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:38:01,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 4 [2024-11-23 22:38:01,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653238952] [2024-11-23 22:38:01,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:38:01,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:38:01,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:38:01,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:38:01,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:38:01,692 INFO L87 Difference]: Start difference. First operand 631 states and 844 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-23 22:38:01,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:38:01,909 INFO L93 Difference]: Finished difference Result 1124 states and 1552 transitions. [2024-11-23 22:38:01,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:38:01,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-23 22:38:01,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:38:01,916 INFO L225 Difference]: With dead ends: 1124 [2024-11-23 22:38:01,916 INFO L226 Difference]: Without dead ends: 584 [2024-11-23 22:38:01,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-23 22:38:01,922 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:38:01,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 231 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:38:01,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2024-11-23 22:38:02,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 583. [2024-11-23 22:38:02,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 583 states, 444 states have (on average 1.2207207207207207) internal successors, (542), 465 states have internal predecessors, (542), 83 states have call successors, (83), 37 states have call predecessors, (83), 55 states have return successors, (133), 80 states have call predecessors, (133), 78 states have call successors, (133) [2024-11-23 22:38:02,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 758 transitions. [2024-11-23 22:38:02,100 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 758 transitions. Word has length 91 [2024-11-23 22:38:02,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:38:02,101 INFO L471 AbstractCegarLoop]: Abstraction has 583 states and 758 transitions. [2024-11-23 22:38:02,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-23 22:38:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 758 transitions. [2024-11-23 22:38:02,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-23 22:38:02,105 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:38:02,106 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:38:02,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-23 22:38:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:38:02,307 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:38:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:38:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1244925713, now seen corresponding path program 1 times [2024-11-23 22:38:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:38:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450169018] [2024-11-23 22:38:02,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:38:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:38:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:38:02,478 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2024-11-23 22:38:02,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:38:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450169018] [2024-11-23 22:38:02,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450169018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:38:02,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015327658] [2024-11-23 22:38:02,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:38:02,479 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:38:02,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:38:02,482 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:38:02,486 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-23 22:38:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:38:02,813 INFO L256 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-23 22:38:02,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:38:02,824 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:38:02,824 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:38:02,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1015327658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:38:02,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:38:02,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2024-11-23 22:38:02,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894329859] [2024-11-23 22:38:02,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:38:02,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-23 22:38:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:38:02,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-23 22:38:02,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:38:02,826 INFO L87 Difference]: Start difference. First operand 583 states and 758 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-23 22:38:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:38:02,935 INFO L93 Difference]: Finished difference Result 817 states and 1108 transitions. [2024-11-23 22:38:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-23 22:38:02,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2024-11-23 22:38:02,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:38:02,939 INFO L225 Difference]: With dead ends: 817 [2024-11-23 22:38:02,939 INFO L226 Difference]: Without dead ends: 317 [2024-11-23 22:38:02,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-23 22:38:02,943 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 1 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:38:02,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 229 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:38:02,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2024-11-23 22:38:03,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 311. [2024-11-23 22:38:03,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 233 states have (on average 1.1630901287553648) internal successors, (271), 244 states have internal predecessors, (271), 47 states have call successors, (47), 22 states have call predecessors, (47), 30 states have return successors, (75), 44 states have call predecessors, (75), 44 states have call successors, (75) [2024-11-23 22:38:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 393 transitions. [2024-11-23 22:38:03,021 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 393 transitions. Word has length 91 [2024-11-23 22:38:03,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:38:03,022 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 393 transitions. [2024-11-23 22:38:03,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2024-11-23 22:38:03,022 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 393 transitions. [2024-11-23 22:38:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-23 22:38:03,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:38:03,025 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:38:03,040 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-23 22:38:03,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:38:03,226 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:38:03,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:38:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1212899100, now seen corresponding path program 1 times [2024-11-23 22:38:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:38:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617520237] [2024-11-23 22:38:03,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:38:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:38:03,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:38:03,635 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-23 22:38:03,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:38:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617520237] [2024-11-23 22:38:03,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617520237] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:38:03,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [641306168] [2024-11-23 22:38:03,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:38:03,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:38:03,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:38:03,639 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:38:03,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-23 22:38:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:38:03,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 91 conjuncts are in the unsatisfiable core [2024-11-23 22:38:04,005 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:38:04,153 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:38:04,154 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 21 treesize of output 1 [2024-11-23 22:38:04,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:38:04,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-23 22:38:04,163 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 22 treesize of output 22 [2024-11-23 22:38:04,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2024-11-23 22:38:08,197 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_51| Int)) (<= (+ (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_51|) 24) 2) |v_ULTIMATE.start_aws_linked_list_rbegin_harness_~#list~0#1.base_BEFORE_CALL_51|)) is different from true [2024-11-23 22:38:32,984 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 30 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-23 22:38:32,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-23 22:38:59,807 INFO L349 Elim1Store]: treesize reduction 63, result has 62.0 percent of original size [2024-11-23 22:38:59,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 2782 treesize of output 2653 [2024-11-23 22:38:59,889 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 6561 treesize of output 6313 [2024-11-23 22:38:59,966 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 1947 treesize of output 1921 [2024-11-23 22:39:00,012 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 1921 treesize of output 1869 [2024-11-23 22:39:00,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:39:00,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2295 treesize of output 2191 [2024-11-23 22:39:05,384 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-23 22:39:05,461 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 5 treesize of output 3 [2024-11-23 22:39:05,470 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:39:05,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 8 [2024-11-23 22:39:05,480 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-23 22:39:05,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 60 treesize of output 52 [2024-11-23 22:39:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:39:05,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [641306168] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-23 22:39:05,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-23 22:39:05,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 18] total 35 [2024-11-23 22:39:05,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110989158] [2024-11-23 22:39:05,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-23 22:39:05,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-23 22:39:05,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:39:05,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-23 22:39:05,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1014, Unknown=13, NotChecked=64, Total=1190 [2024-11-23 22:39:05,724 INFO L87 Difference]: Start difference. First operand 311 states and 393 transitions. Second operand has 35 states, 33 states have (on average 4.181818181818182) internal successors, (138), 30 states have internal predecessors, (138), 11 states have call successors, (29), 4 states have call predecessors, (29), 8 states have return successors, (27), 8 states have call predecessors, (27), 10 states have call successors, (27) [2024-11-23 22:39:09,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:39:13,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:39:17,888 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:39:21,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:39:30,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:39:35,063 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:39:39,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:39:43,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-23 22:39:47,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-23 22:39:55,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-23 22:39:59,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-23 22:40:03,421 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-23 22:40:08,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:40:12,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:40:16,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:40:20,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:40:24,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-23 22:40:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:40:26,081 INFO L93 Difference]: Finished difference Result 583 states and 740 transitions. [2024-11-23 22:40:26,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-11-23 22:40:26,081 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 4.181818181818182) internal successors, (138), 30 states have internal predecessors, (138), 11 states have call successors, (29), 4 states have call predecessors, (29), 8 states have return successors, (27), 8 states have call predecessors, (27), 10 states have call successors, (27) Word has length 92 [2024-11-23 22:40:26,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:40:26,084 INFO L225 Difference]: With dead ends: 583 [2024-11-23 22:40:26,084 INFO L226 Difference]: Without dead ends: 334 [2024-11-23 22:40:26,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 63.3s TimeCoverageRelationStatistics Valid=181, Invalid=1879, Unknown=14, NotChecked=88, Total=2162 [2024-11-23 22:40:26,087 INFO L435 NwaCegarLoop]: 81 mSDtfsCounter, 60 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 1838 mSolverCounterSat, 13 mSolverCounterUnsat, 17 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 2125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1838 IncrementalHoareTripleChecker+Invalid, 17 IncrementalHoareTripleChecker+Unknown, 257 IncrementalHoareTripleChecker+Unchecked, 71.3s IncrementalHoareTripleChecker+Time [2024-11-23 22:40:26,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1615 Invalid, 2125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1838 Invalid, 17 Unknown, 257 Unchecked, 71.3s Time] [2024-11-23 22:40:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-23 22:40:26,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 297. [2024-11-23 22:40:26,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 226 states have (on average 1.176991150442478) internal successors, (266), 235 states have internal predecessors, (266), 44 states have call successors, (44), 20 states have call predecessors, (44), 26 states have return successors, (60), 41 states have call predecessors, (60), 41 states have call successors, (60) [2024-11-23 22:40:26,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 370 transitions. [2024-11-23 22:40:26,162 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 370 transitions. Word has length 92 [2024-11-23 22:40:26,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:40:26,163 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 370 transitions. [2024-11-23 22:40:26,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 4.181818181818182) internal successors, (138), 30 states have internal predecessors, (138), 11 states have call successors, (29), 4 states have call predecessors, (29), 8 states have return successors, (27), 8 states have call predecessors, (27), 10 states have call successors, (27) [2024-11-23 22:40:26,163 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 370 transitions. [2024-11-23 22:40:26,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-23 22:40:26,165 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:40:26,166 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:40:26,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-23 22:40:26,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:40:26,370 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:40:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:40:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash 1497628778, now seen corresponding path program 1 times [2024-11-23 22:40:26,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:40:26,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593334267] [2024-11-23 22:40:26,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:40:26,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:40:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-23 22:40:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-23 22:40:26,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:40:26,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593334267] [2024-11-23 22:40:26,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593334267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:40:26,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-23 22:40:26,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-23 22:40:26,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191417085] [2024-11-23 22:40:26,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:40:26,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-23 22:40:26,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:40:26,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-23 22:40:26,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-23 22:40:26,895 INFO L87 Difference]: Start difference. First operand 297 states and 370 transitions. Second operand has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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) [2024-11-23 22:40:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:40:27,076 INFO L93 Difference]: Finished difference Result 317 states and 392 transitions. [2024-11-23 22:40:27,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-23 22:40:27,077 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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 110 [2024-11-23 22:40:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:40:27,081 INFO L225 Difference]: With dead ends: 317 [2024-11-23 22:40:27,081 INFO L226 Difference]: Without dead ends: 315 [2024-11-23 22:40:27,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-23 22:40:27,082 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 3 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-23 22:40:27,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 452 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-23 22:40:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2024-11-23 22:40:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 302. [2024-11-23 22:40:27,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 229 states have (on average 1.1746724890829694) internal successors, (269), 238 states have internal predecessors, (269), 45 states have call successors, (45), 21 states have call predecessors, (45), 27 states have return successors, (61), 42 states have call predecessors, (61), 42 states have call successors, (61) [2024-11-23 22:40:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 375 transitions. [2024-11-23 22:40:27,185 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 375 transitions. Word has length 110 [2024-11-23 22:40:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:40:27,186 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 375 transitions. [2024-11-23 22:40:27,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.333333333333333) internal successors, (44), 5 states have internal predecessors, (44), 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) [2024-11-23 22:40:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 375 transitions. [2024-11-23 22:40:27,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-23 22:40:27,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:40:27,189 INFO L218 NwaCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-23 22:40:27,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-23 22:40:27,189 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:40:27,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:40:27,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1886091741, now seen corresponding path program 2 times [2024-11-23 22:40:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:40:27,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848209571] [2024-11-23 22:40:27,190 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 22:40:27,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:40:27,263 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 22:40:27,265 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 22:40:27,702 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2024-11-23 22:40:27,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-23 22:40:27,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848209571] [2024-11-23 22:40:27,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848209571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-23 22:40:27,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049921823] [2024-11-23 22:40:27,703 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-23 22:40:27,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:40:27,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-23 22:40:27,705 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-23 22:40:27,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-23 22:40:28,059 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-23 22:40:28,059 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-23 22:40:28,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-23 22:40:28,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-23 22:40:28,151 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 0 case distinctions, treesize of input 9 treesize of output 8 [2024-11-23 22:40:28,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-23 22:40:28,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-23 22:40:28,166 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 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-23 22:40:29,034 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-23 22:40:29,034 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-23 22:40:29,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049921823] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-23 22:40:29,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-23 22:40:29,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [7] total 19 [2024-11-23 22:40:29,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114462526] [2024-11-23 22:40:29,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-23 22:40:29,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-23 22:40:29,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-23 22:40:29,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-23 22:40:29,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-11-23 22:40:29,036 INFO L87 Difference]: Start difference. First operand 302 states and 375 transitions. Second operand has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 6 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-23 22:40:29,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-23 22:40:29,984 INFO L93 Difference]: Finished difference Result 360 states and 444 transitions. [2024-11-23 22:40:29,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-23 22:40:29,985 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 6 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) Word has length 113 [2024-11-23 22:40:29,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-23 22:40:29,987 INFO L225 Difference]: With dead ends: 360 [2024-11-23 22:40:29,987 INFO L226 Difference]: Without dead ends: 304 [2024-11-23 22:40:29,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 97 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-23 22:40:29,989 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 20 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-23 22:40:29,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 621 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-23 22:40:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-23 22:40:30,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2024-11-23 22:40:30,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 229 states have (on average 1.1746724890829694) internal successors, (269), 238 states have internal predecessors, (269), 45 states have call successors, (45), 21 states have call predecessors, (45), 27 states have return successors, (60), 42 states have call predecessors, (60), 42 states have call successors, (60) [2024-11-23 22:40:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 374 transitions. [2024-11-23 22:40:30,064 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 374 transitions. Word has length 113 [2024-11-23 22:40:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-23 22:40:30,065 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 374 transitions. [2024-11-23 22:40:30,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 6.166666666666667) internal successors, (74), 12 states have internal predecessors, (74), 6 states have call successors, (10), 3 states have call predecessors, (10), 6 states have return successors, (10), 6 states have call predecessors, (10), 6 states have call successors, (10) [2024-11-23 22:40:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 374 transitions. [2024-11-23 22:40:30,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-23 22:40:30,067 INFO L210 NwaCegarLoop]: Found error trace [2024-11-23 22:40:30,067 INFO L218 NwaCegarLoop]: trace histogram [6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:40:30,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-23 22:40:30,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-23 22:40:30,268 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-23 22:40:30,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-23 22:40:30,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1330556572, now seen corresponding path program 1 times [2024-11-23 22:40:30,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-23 22:40:30,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176269126] [2024-11-23 22:40:30,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-23 22:40:30,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-23 22:40:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:40:30,404 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-23 22:40:30,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-23 22:40:30,546 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-23 22:40:30,546 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-23 22:40:30,548 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-23 22:40:30,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-23 22:40:30,554 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-23 22:40:30,659 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-23 22:40:30,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:40:30 BoogieIcfgContainer [2024-11-23 22:40:30,669 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-23 22:40:30,670 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-23 22:40:30,670 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-23 22:40:30,670 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-23 22:40:30,671 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:35:13" (3/4) ... [2024-11-23 22:40:30,672 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-23 22:40:30,787 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 58. [2024-11-23 22:40:30,909 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/witness.graphml [2024-11-23 22:40:30,913 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/witness.yml [2024-11-23 22:40:30,913 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-23 22:40:30,914 INFO L158 Benchmark]: Toolchain (without parser) took 320517.61ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 86.5MB in the beginning and 305.0MB in the end (delta: -218.4MB). Peak memory consumption was 232.4MB. Max. memory is 16.1GB. [2024-11-23 22:40:30,918 INFO L158 Benchmark]: CDTParser took 0.71ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:40:30,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 2636.32ms. Allocated memory is still 117.4MB. Free memory was 86.3MB in the beginning and 60.8MB in the end (delta: 25.5MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2024-11-23 22:40:30,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.93ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 55.7MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 22:40:30,919 INFO L158 Benchmark]: Boogie Preprocessor took 95.06ms. Allocated memory is still 117.4MB. Free memory was 55.7MB in the beginning and 51.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-23 22:40:30,919 INFO L158 Benchmark]: RCFGBuilder took 711.48ms. Allocated memory is still 117.4MB. Free memory was 51.8MB in the beginning and 66.6MB in the end (delta: -14.8MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2024-11-23 22:40:30,919 INFO L158 Benchmark]: TraceAbstraction took 316716.98ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 65.8MB in the beginning and 313.3MB in the end (delta: -247.5MB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. [2024-11-23 22:40:30,920 INFO L158 Benchmark]: Witness Printer took 243.95ms. Allocated memory is still 570.4MB. Free memory was 313.3MB in the beginning and 305.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-23 22:40:30,921 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.71ms. Allocated memory is still 117.4MB. Free memory is still 73.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 2636.32ms. Allocated memory is still 117.4MB. Free memory was 86.3MB in the beginning and 60.8MB in the end (delta: 25.5MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.93ms. Allocated memory is still 117.4MB. Free memory was 60.8MB in the beginning and 55.7MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.06ms. Allocated memory is still 117.4MB. Free memory was 55.7MB in the beginning and 51.8MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 711.48ms. Allocated memory is still 117.4MB. Free memory was 51.8MB in the beginning and 66.6MB in the end (delta: -14.8MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 316716.98ms. Allocated memory was 117.4MB in the beginning and 570.4MB in the end (delta: 453.0MB). Free memory was 65.8MB in the beginning and 313.3MB in the end (delta: -247.5MB). Peak memory consumption was 207.8MB. Max. memory is 16.1GB. * Witness Printer took 243.95ms. Allocated memory is still 570.4MB. Free memory was 313.3MB in the beginning and 305.0MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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 - CounterExampleResult [Line: 223]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L6901-L6906] static struct aws_allocator s_can_fail_allocator_static = { .mem_acquire = s_can_fail_malloc_allocator, .mem_release = s_can_fail_free_allocator, .mem_realloc = s_can_fail_realloc_allocator, .mem_calloc = s_can_fail_calloc_allocator, }; [L7326] static __thread int tl_last_error = 0; VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7360] CALL aws_linked_list_rbegin_harness() [L7344] struct aws_linked_list list; [L7346] CALL ensure_linked_list_is_allocated(&list, 20) [L6743] CALL, EXPR nondet_uint64_t() VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L266] return __VERIFIER_nondet_ulong(); [L6743] RET, EXPR nondet_uint64_t() VAL [list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6743] size_t length = nondet_uint64_t(); [L6744] CALL assume_abort_if_not(length <= max_length) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6744] RET assume_abort_if_not(length <= max_length) VAL [length=-((__int128) 1 << 64), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6746-L6747] list->head.prev = ((void *)0) [L6749-L6750] list->tail.next = ((void *)0) [L6753] struct aws_linked_list_node *curr = &list->head; [L6755] size_t i = 0; VAL [curr={7:0}, i=0, length=-((__int128) 1 << 64), list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6755] COND FALSE !(i < length) VAL [curr={7:0}, list={7:0}, max_length=20, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L6764] curr->next = &list->tail [L6765] list->tail.prev = curr VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7346] RET ensure_linked_list_is_allocated(&list, 20) [L7349] CALL, EXPR aws_linked_list_is_valid(&list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L7349] RET, EXPR aws_linked_list_is_valid(&list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] CALL assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7349] RET assume_abort_if_not(aws_linked_list_is_valid(&list)) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L7354] CALL aws_linked_list_rbegin(&list) [L4812] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4812] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4812] CALL assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L211] COND FALSE !(!cond) VAL [\old(cond)=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4812] RET assume_abort_if_not((aws_linked_list_is_valid(list))) VAL [list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4813] EXPR list->tail.prev [L4813] struct aws_linked_list_node *rval = list->tail.prev; [L4814] CALL, EXPR aws_linked_list_is_valid(list) VAL [s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694] EXPR list && list->head.next [L4694] EXPR list->head.next [L4694] EXPR list && list->head.next VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) [L4694] EXPR list->head.prev [L4694-L4695] EXPR list && list->head.next && list->head.prev == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev [L4696] EXPR list->tail.prev [L4694-L4696] EXPR list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4696] EXPR list->tail.next [L4694-L4697] list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) VAL [\old(list)={7:0}, list={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4694-L4697] COND TRUE list && list->head.next && list->head.prev == ((void *)0) && list->tail.prev && list->tail.next == ((void *)0) [L4700] CALL, EXPR aws_linked_list_is_valid_deep(list) [L4734] COND FALSE !(!list) [L4740] const struct aws_linked_list_node *temp = &list->head; [L4743-L4746] _Bool head_reaches_tail = 0 ; VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4751] COND FALSE !(temp == &list->tail) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] CALL, EXPR aws_linked_list_node_next_is_valid(temp) VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next [L4718] EXPR node->next [L4718] EXPR node && node->next VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, node={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] EXPR node && node->next && node->next->prev == node [L4718] EXPR node->next [L4718] EXPR node->next->prev [L4718] EXPR node && node->next && node->next->prev == node VAL [\old(node)={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4718] return node && node->next && node->next->prev == node; [L4756] RET, EXPR aws_linked_list_node_next_is_valid(temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:0}, tl_last_error=0] [L4756] COND FALSE !(!aws_linked_list_node_next_is_valid(temp)) [L4762] EXPR temp->next [L4762] temp = temp->next [L4750] COND TRUE \read(*temp) VAL [head_reaches_tail=0, list={7:0}, s_can_fail_allocator_static={4:0}, temp={7:16}, tl_last_error=0] [L4751] COND TRUE temp == &list->tail [L4752-L4753] head_reaches_tail = 1 VAL [head_reaches_tail=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4764] return head_reaches_tail; VAL [\result=1, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4700] RET, EXPR aws_linked_list_is_valid_deep(list) [L4700] return aws_linked_list_is_valid_deep(list); [L4814] RET, EXPR aws_linked_list_is_valid(list) VAL [list={7:0}, rval={7:0}, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L4814] CALL __VERIFIER_assert(!((aws_linked_list_is_valid(list)))) VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] COND TRUE !cond VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] [L223] reach_error() VAL [\old(cond)=0, s_can_fail_allocator_static={4:0}, tl_last_error=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 69 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 316.5s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 150.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1543 mSolverCounterUnknown, 1847 SdHoareTripleChecker+Valid, 111.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1749 mSDsluCounter, 11724 SdHoareTripleChecker+Invalid, 109.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 865 IncrementalHoareTripleChecker+Unchecked, 10245 mSDsCounter, 535 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9373 IncrementalHoareTripleChecker+Invalid, 12316 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 535 mSolverCounterUnsat, 1479 mSDtfsCounter, 9373 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 1543 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1890 GetRequests, 1397 SyntacticMatches, 37 SemanticMatches, 456 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 7109 ImplicationChecksByTransitivity, 157.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=631occurred in iteration=14, InterpolantAutomatonStates: 333, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 342 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 156.3s InterpolantComputationTime, 2821 NumberOfCodeBlocks, 2821 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3083 ConstructedInterpolants, 384 QuantifiedInterpolants, 48398 SizeOfPredicates, 75 NumberOfNonLiveVariables, 5252 ConjunctsInSsa, 609 ConjunctsInUnsatCore, 38 InterpolantComputations, 15 PerfectInterpolantSequences, 1680/1940 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-23 22:40:31,054 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8e737a79-416b-47f4-989c-6463461d575b/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE